./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/cmp-freed-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/cmp-freed-ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63302b5441ba85cd38f4ed3669bf40852137e8be39297cc19159731ba051a536 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:40:07,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:40:07,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:40:07,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:40:07,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:40:07,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:40:07,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:40:07,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:40:07,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:40:07,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:40:07,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:40:07,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:40:07,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:40:07,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:40:07,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:40:07,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:40:07,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:40:07,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:40:07,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:40:07,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:40:07,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:40:07,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:40:07,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:40:07,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:40:07,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:40:07,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:40:07,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:40:07,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:40:07,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:40:07,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:40:07,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:40:07,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:40:07,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:40:07,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:40:07,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:40:07,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:40:07,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:40:07,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:40:07,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:40:07,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:40:07,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:40:07,289 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 01:40:07,336 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:40:07,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:40:07,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:40:07,337 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:40:07,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:40:07,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:40:07,339 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:40:07,339 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:40:07,340 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:40:07,340 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:40:07,341 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:40:07,341 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:40:07,341 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:40:07,342 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:40:07,342 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:40:07,342 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:40:07,342 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:40:07,343 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:40:07,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:40:07,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:40:07,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:40:07,344 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:40:07,345 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:40:07,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:40:07,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:40:07,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:40:07,346 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:40:07,346 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:40:07,346 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:40:07,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:40:07,347 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:40:07,347 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:40:07,347 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:40:07,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:40:07,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:40:07,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:40:07,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:40:07,349 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:40:07,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:40:07,349 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:40:07,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:40:07,350 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:40:07,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63302b5441ba85cd38f4ed3669bf40852137e8be39297cc19159731ba051a536 [2022-11-03 01:40:07,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:40:07,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:40:07,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:40:07,740 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:40:07,741 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:40:07,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2022-11-03 01:40:07,816 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/data/afc4646bc/2e29962825734db9964e22198fd68456/FLAGb5c0d8fdb [2022-11-03 01:40:08,394 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:40:08,394 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2022-11-03 01:40:08,407 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/data/afc4646bc/2e29962825734db9964e22198fd68456/FLAGb5c0d8fdb [2022-11-03 01:40:08,683 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/data/afc4646bc/2e29962825734db9964e22198fd68456 [2022-11-03 01:40:08,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:40:08,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:40:08,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:40:08,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:40:08,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:40:08,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:40:08" (1/1) ... [2022-11-03 01:40:08,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c3de99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:08, skipping insertion in model container [2022-11-03 01:40:08,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:40:08" (1/1) ... [2022-11-03 01:40:08,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:40:08,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:40:09,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:40:09,133 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:40:09,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:40:09,203 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:40:09,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09 WrapperNode [2022-11-03 01:40:09,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:40:09,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:40:09,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:40:09,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:40:09,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,259 INFO L138 Inliner]: procedures = 112, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-11-03 01:40:09,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:40:09,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:40:09,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:40:09,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:40:09,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,294 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:40:09,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:40:09,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:40:09,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:40:09,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (1/1) ... [2022-11-03 01:40:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:40:09,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:40:09,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:40:09,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:40:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:40:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:40:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:40:09,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:40:09,515 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:40:09,518 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:40:09,688 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:40:09,701 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:40:09,702 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 01:40:09,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:40:09 BoogieIcfgContainer [2022-11-03 01:40:09,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:40:09,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:40:09,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:40:09,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:40:09,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:40:08" (1/3) ... [2022-11-03 01:40:09,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1c2dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:40:09, skipping insertion in model container [2022-11-03 01:40:09,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:40:09" (2/3) ... [2022-11-03 01:40:09,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1c2dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:40:09, skipping insertion in model container [2022-11-03 01:40:09,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:40:09" (3/3) ... [2022-11-03 01:40:09,742 INFO L112 eAbstractionObserver]: Analyzing ICFG cmp-freed-ptr.i [2022-11-03 01:40:09,778 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:40:09,779 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-03 01:40:09,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:40:09,850 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@22abb1db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:40:09,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-03 01:40:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 01:40:09,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:09,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 01:40:09,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-11-03 01:40:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1925, now seen corresponding path program 1 times [2022-11-03 01:40:09,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:09,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107281385] [2022-11-03 01:40:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:10,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:10,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107281385] [2022-11-03 01:40:10,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107281385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:10,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:40:10,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:40:10,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045569351] [2022-11-03 01:40:10,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:10,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:40:10,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:10,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:40:10,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,179 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:10,216 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-11-03 01:40:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:40:10,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-03 01:40:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:10,227 INFO L225 Difference]: With dead ends: 22 [2022-11-03 01:40:10,228 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 01:40:10,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,238 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:10,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:40:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 01:40:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-03 01:40:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.75) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-11-03 01:40:10,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 2 [2022-11-03 01:40:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:10,275 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-11-03 01:40:10,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-11-03 01:40:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:40:10,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:10,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:40:10,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:40:10,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-11-03 01:40:10,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:10,277 INFO L85 PathProgramCache]: Analyzing trace with hash 59711, now seen corresponding path program 1 times [2022-11-03 01:40:10,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:10,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163545714] [2022-11-03 01:40:10,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:10,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:10,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:10,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163545714] [2022-11-03 01:40:10,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163545714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:10,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:40:10,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:40:10,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637868200] [2022-11-03 01:40:10,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:10,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:40:10,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:10,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:40:10,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,358 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:10,386 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-11-03 01:40:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:40:10,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 01:40:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:10,388 INFO L225 Difference]: With dead ends: 20 [2022-11-03 01:40:10,388 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 01:40:10,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,390 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:10,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:40:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 01:40:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-03 01:40:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-11-03 01:40:10,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 3 [2022-11-03 01:40:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:10,395 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-11-03 01:40:10,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-11-03 01:40:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 01:40:10,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:10,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 01:40:10,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:40:10,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-11-03 01:40:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1851079, now seen corresponding path program 1 times [2022-11-03 01:40:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:10,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534214354] [2022-11-03 01:40:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:10,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:10,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534214354] [2022-11-03 01:40:10,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534214354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:10,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:40:10,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:40:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335949649] [2022-11-03 01:40:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:10,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:40:10,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:10,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:40:10,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,535 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:10,559 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-11-03 01:40:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:40:10,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-03 01:40:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:10,561 INFO L225 Difference]: With dead ends: 19 [2022-11-03 01:40:10,562 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 01:40:10,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,564 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:10,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:40:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 01:40:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-03 01:40:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-11-03 01:40:10,574 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 4 [2022-11-03 01:40:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:10,575 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-11-03 01:40:10,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-11-03 01:40:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 01:40:10,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:10,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 01:40:10,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:40:10,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-11-03 01:40:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1778888490, now seen corresponding path program 1 times [2022-11-03 01:40:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:10,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446421528] [2022-11-03 01:40:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:10,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:10,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:10,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446421528] [2022-11-03 01:40:10,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446421528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:10,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:40:10,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:40:10,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32750475] [2022-11-03 01:40:10,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:10,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:40:10,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:40:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,629 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:10,639 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-11-03 01:40:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:40:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 01:40:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:10,640 INFO L225 Difference]: With dead ends: 17 [2022-11-03 01:40:10,640 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 01:40:10,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,642 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:10,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:40:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 01:40:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 01:40:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-11-03 01:40:10,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 6 [2022-11-03 01:40:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:10,646 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-11-03 01:40:10,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-11-03 01:40:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:40:10,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:10,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:40:10,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:40:10,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-11-03 01:40:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash -689031604, now seen corresponding path program 1 times [2022-11-03 01:40:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:10,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964477721] [2022-11-03 01:40:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:10,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:10,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964477721] [2022-11-03 01:40:10,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964477721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:10,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:40:10,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:40:10,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301465944] [2022-11-03 01:40:10,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:10,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:40:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:10,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:40:10,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,684 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:10,701 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-11-03 01:40:10,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:40:10,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:40:10,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:10,702 INFO L225 Difference]: With dead ends: 15 [2022-11-03 01:40:10,702 INFO L226 Difference]: Without dead ends: 15 [2022-11-03 01:40:10,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,704 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:10,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:40:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-03 01:40:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-03 01:40:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-03 01:40:10,707 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2022-11-03 01:40:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:10,708 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-03 01:40:10,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-03 01:40:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:40:10,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:10,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:40:10,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:40:10,709 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-11-03 01:40:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash 114856812, now seen corresponding path program 1 times [2022-11-03 01:40:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:10,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448220914] [2022-11-03 01:40:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:10,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:10,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:10,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448220914] [2022-11-03 01:40:10,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448220914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:10,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:40:10,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:40:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042954289] [2022-11-03 01:40:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:10,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:40:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:10,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:40:10,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,809 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:10,834 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-11-03 01:40:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:40:10,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 01:40:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:10,837 INFO L225 Difference]: With dead ends: 17 [2022-11-03 01:40:10,837 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 01:40:10,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:40:10,839 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:10,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:40:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 01:40:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 01:40:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-11-03 01:40:10,850 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 8 [2022-11-03 01:40:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:10,850 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-11-03 01:40:10,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-11-03 01:40:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:40:10,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:10,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:40:10,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:40:10,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-11-03 01:40:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -734406065, now seen corresponding path program 1 times [2022-11-03 01:40:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:10,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70829350] [2022-11-03 01:40:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:10,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:40:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:40:11,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:40:11,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70829350] [2022-11-03 01:40:11,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70829350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:40:11,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:40:11,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:40:11,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992355254] [2022-11-03 01:40:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:40:11,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:40:11,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:40:11,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:40:11,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:40:11,114 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:40:11,148 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-03 01:40:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:40:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 01:40:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:40:11,149 INFO L225 Difference]: With dead ends: 16 [2022-11-03 01:40:11,149 INFO L226 Difference]: Without dead ends: 12 [2022-11-03 01:40:11,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:40:11,151 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:40:11,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 17 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:40:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-03 01:40:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-03 01:40:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2022-11-03 01:40:11,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 9 [2022-11-03 01:40:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:40:11,154 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2022-11-03 01:40:11,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:40:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-11-03 01:40:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:40:11,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:40:11,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:40:11,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:40:11,156 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-11-03 01:40:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:40:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -165933941, now seen corresponding path program 1 times [2022-11-03 01:40:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:40:11,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659007534] [2022-11-03 01:40:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:40:11,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:40:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:40:11,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 01:40:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:40:11,229 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 01:40:11,230 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 01:40:11,231 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 10 remaining) [2022-11-03 01:40:11,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (8 of 10 remaining) [2022-11-03 01:40:11,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (7 of 10 remaining) [2022-11-03 01:40:11,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 10 remaining) [2022-11-03 01:40:11,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (5 of 10 remaining) [2022-11-03 01:40:11,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (4 of 10 remaining) [2022-11-03 01:40:11,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2022-11-03 01:40:11,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2022-11-03 01:40:11,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2022-11-03 01:40:11,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-03 01:40:11,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:40:11,239 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:40:11,243 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:40:11,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:40:11 BoogieIcfgContainer [2022-11-03 01:40:11,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:40:11,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:40:11,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:40:11,265 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:40:11,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:40:09" (3/4) ... [2022-11-03 01:40:11,268 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 01:40:11,302 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:40:11,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:40:11,303 INFO L158 Benchmark]: Toolchain (without parser) took 2615.99ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 58.9MB in the beginning and 89.2MB in the end (delta: -30.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:40:11,303 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 98.6MB. Free memory was 77.3MB in the beginning and 77.2MB in the end (delta: 73.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:40:11,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.78ms. Allocated memory is still 98.6MB. Free memory was 58.8MB in the beginning and 67.8MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 01:40:11,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.24ms. Allocated memory is still 98.6MB. Free memory was 67.8MB in the beginning and 65.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:40:11,311 INFO L158 Benchmark]: Boogie Preprocessor took 35.59ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 64.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:40:11,312 INFO L158 Benchmark]: RCFGBuilder took 419.46ms. Allocated memory is still 98.6MB. Free memory was 64.9MB in the beginning and 53.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:40:11,312 INFO L158 Benchmark]: TraceAbstraction took 1545.62ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 53.1MB in the beginning and 91.3MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:40:11,312 INFO L158 Benchmark]: Witness Printer took 37.93ms. Allocated memory is still 119.5MB. Free memory was 90.5MB in the beginning and 89.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:40:11,315 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 98.6MB. Free memory was 77.3MB in the beginning and 77.2MB in the end (delta: 73.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.78ms. Allocated memory is still 98.6MB. Free memory was 58.8MB in the beginning and 67.8MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.24ms. Allocated memory is still 98.6MB. Free memory was 67.8MB in the beginning and 65.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.59ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 64.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.46ms. Allocated memory is still 98.6MB. Free memory was 64.9MB in the beginning and 53.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1545.62ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 53.1MB in the beginning and 91.3MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 37.93ms. Allocated memory is still 119.5MB. Free memory was 90.5MB in the beginning and 89.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 554]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L543] struct T* x = ((void *)0); [L544] struct T* y = ((void *)0); [L545] y = malloc(sizeof(*y)) [L546] intptr_t adressY = (intptr_t) y; VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) [L548] x = malloc(sizeof(*x)) [L549] intptr_t adressX = (intptr_t) x; VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L550] COND TRUE adressX == adressY VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 82 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 01:40:11,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51a7a35-8cee-40f2-b64d-06a77e60c8ae/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)