./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:44:02,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:44:02,983 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-14 02:44:02,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:44:02,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:44:03,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:44:03,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:44:03,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:44:03,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:44:03,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:44:03,033 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:44:03,033 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:44:03,034 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:44:03,034 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:44:03,034 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:44:03,035 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:44:03,035 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:44:03,035 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:44:03,036 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:44:03,036 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:44:03,036 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:44:03,036 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:44:03,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 02:44:03,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 02:44:03,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:44:03,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:44:03,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:44:03,037 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 02:44:03,037 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 02:44:03,037 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 02:44:03,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:44:03,038 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 02:44:03,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:44:03,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 02:44:03,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:44:03,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:44:03,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:44:03,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:44:03,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:44:03,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:44:03,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:44:03,040 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:44:03,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:44:03,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:44:03,040 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:44:03,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:44:03,041 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 [2024-11-14 02:44:03,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:44:03,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:44:03,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:44:03,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:44:03,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:44:03,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i Unable to find full path for "g++" [2024-11-14 02:44:05,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:44:05,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:44:05,620 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2024-11-14 02:44:05,652 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/data/af3554507/1630b95940b04505950835e6317ccb9d/FLAGdd44ea23b [2024-11-14 02:44:05,676 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/data/af3554507/1630b95940b04505950835e6317ccb9d [2024-11-14 02:44:05,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:44:05,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:44:05,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:44:05,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:44:05,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:44:05,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:44:05" (1/1) ... [2024-11-14 02:44:05,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a6c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:05, skipping insertion in model container [2024-11-14 02:44:05,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:44:05" (1/1) ... [2024-11-14 02:44:05,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:44:06,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:44:06,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:44:06,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:44:06,192 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:44:06,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06 WrapperNode [2024-11-14 02:44:06,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:44:06,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:44:06,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:44:06,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:44:06,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,249 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2024-11-14 02:44:06,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:44:06,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:44:06,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:44:06,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:44:06,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:44:06,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:44:06,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:44:06,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:44:06,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (1/1) ... [2024-11-14 02:44:06,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:44:06,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:44:06,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:44:06,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:44:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure loop_internal [2024-11-14 02:44:06,386 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_internal [2024-11-14 02:44:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-11-14 02:44:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-11-14 02:44:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2024-11-14 02:44:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2024-11-14 02:44:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-14 02:44:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-14 02:44:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 02:44:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 02:44:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_internal [2024-11-14 02:44:06,388 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_internal [2024-11-14 02:44:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 02:44:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 02:44:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:44:06,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:44:06,505 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:44:06,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:44:06,937 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-14 02:44:06,937 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:44:07,033 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:44:07,033 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-14 02:44:07,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:44:07 BoogieIcfgContainer [2024-11-14 02:44:07,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:44:07,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:44:07,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:44:07,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:44:07,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:44:05" (1/3) ... [2024-11-14 02:44:07,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d385eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:44:07, skipping insertion in model container [2024-11-14 02:44:07,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:06" (2/3) ... [2024-11-14 02:44:07,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d385eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:44:07, skipping insertion in model container [2024-11-14 02:44:07,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:44:07" (3/3) ... [2024-11-14 02:44:07,066 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-twice.i [2024-11-14 02:44:07,083 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:44:07,084 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-nested-sll-twice.i that has 6 procedures, 119 locations, 1 initial locations, 6 loop locations, and 51 error locations. [2024-11-14 02:44:07,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:44:07,147 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@1fd8b124, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:44:07,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-14 02:44:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 50 states have (on average 2.18) internal successors, (109), 101 states have internal predecessors, (109), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 02:44:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 02:44:07,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:07,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 02:44:07,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:07,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash 8087361, now seen corresponding path program 1 times [2024-11-14 02:44:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:07,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735871115] [2024-11-14 02:44:07,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:07,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735871115] [2024-11-14 02:44:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735871115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:44:07,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:44:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:44:07,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51496918] [2024-11-14 02:44:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:44:07,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:44:07,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:44:07,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:44:07,476 INFO L87 Difference]: Start difference. First operand has 119 states, 50 states have (on average 2.18) internal successors, (109), 101 states have internal predecessors, (109), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:44:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:07,703 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2024-11-14 02:44:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:44:07,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 02:44:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:07,713 INFO L225 Difference]: With dead ends: 116 [2024-11-14 02:44:07,713 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 02:44:07,716 INFO L431 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 [2024-11-14 02:44:07,721 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:07,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 170 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:44:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 02:44:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-14 02:44:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 50 states have (on average 2.06) internal successors, (103), 97 states have internal predecessors, (103), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 02:44:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2024-11-14 02:44:07,775 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 4 [2024-11-14 02:44:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:07,776 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2024-11-14 02:44:07,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:44:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2024-11-14 02:44:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 02:44:07,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:07,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 02:44:07,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 02:44:07,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:07,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 8087362, now seen corresponding path program 1 times [2024-11-14 02:44:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:07,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290220983] [2024-11-14 02:44:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:07,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:07,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:07,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290220983] [2024-11-14 02:44:07,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290220983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:44:07,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:44:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:44:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914024053] [2024-11-14 02:44:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:44:07,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:44:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:44:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:44:07,936 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:44:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:08,099 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-14 02:44:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:44:08,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 02:44:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:08,101 INFO L225 Difference]: With dead ends: 112 [2024-11-14 02:44:08,101 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 02:44:08,101 INFO L431 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 [2024-11-14 02:44:08,102 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:08,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 175 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:44:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 02:44:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-14 02:44:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 50 states have (on average 2.0) internal successors, (100), 94 states have internal predecessors, (100), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 02:44:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-14 02:44:08,111 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 4 [2024-11-14 02:44:08,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:08,111 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-14 02:44:08,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:44:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-14 02:44:08,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 02:44:08,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:08,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:08,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 02:44:08,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:08,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:08,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2128125831, now seen corresponding path program 1 times [2024-11-14 02:44:08,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:08,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282014555] [2024-11-14 02:44:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:08,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:08,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282014555] [2024-11-14 02:44:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282014555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:44:08,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:44:08,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:44:08,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789225511] [2024-11-14 02:44:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:44:08,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:44:08,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:08,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:44:08,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:44:08,214 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 02:44:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:08,349 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2024-11-14 02:44:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:44:08,351 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-14 02:44:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:08,352 INFO L225 Difference]: With dead ends: 111 [2024-11-14 02:44:08,352 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 02:44:08,352 INFO L431 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 [2024-11-14 02:44:08,353 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:08,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:44:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 02:44:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-14 02:44:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 50 states have (on average 1.98) internal successors, (99), 93 states have internal predecessors, (99), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 02:44:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2024-11-14 02:44:08,373 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 12 [2024-11-14 02:44:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:08,374 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2024-11-14 02:44:08,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 02:44:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2024-11-14 02:44:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 02:44:08,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:08,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:08,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 02:44:08,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:08,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:08,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2128125830, now seen corresponding path program 1 times [2024-11-14 02:44:08,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:08,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142764462] [2024-11-14 02:44:08,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:08,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:08,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:08,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142764462] [2024-11-14 02:44:08,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142764462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:44:08,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:44:08,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:44:08,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843396406] [2024-11-14 02:44:08,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:44:08,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:44:08,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:08,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:44:08,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:44:08,678 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 02:44:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:08,813 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2024-11-14 02:44:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:44:08,814 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-14 02:44:08,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:08,815 INFO L225 Difference]: With dead ends: 110 [2024-11-14 02:44:08,817 INFO L226 Difference]: Without dead ends: 110 [2024-11-14 02:44:08,818 INFO L431 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 [2024-11-14 02:44:08,819 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:08,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:44:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-14 02:44:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-14 02:44:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 50 states have (on average 1.96) internal successors, (98), 92 states have internal predecessors, (98), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 02:44:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-11-14 02:44:08,836 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 12 [2024-11-14 02:44:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:08,836 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-11-14 02:44:08,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 02:44:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-11-14 02:44:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 02:44:08,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:08,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:08,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 02:44:08,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:08,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:08,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1695361526, now seen corresponding path program 1 times [2024-11-14 02:44:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394289976] [2024-11-14 02:44:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:09,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:09,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394289976] [2024-11-14 02:44:09,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394289976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:44:09,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:44:09,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 02:44:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835015976] [2024-11-14 02:44:09,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:44:09,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 02:44:09,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:09,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 02:44:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:44:09,295 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 02:44:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:09,986 INFO L93 Difference]: Finished difference Result 140 states and 166 transitions. [2024-11-14 02:44:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 02:44:09,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-11-14 02:44:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:09,990 INFO L225 Difference]: With dead ends: 140 [2024-11-14 02:44:09,990 INFO L226 Difference]: Without dead ends: 140 [2024-11-14 02:44:09,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-14 02:44:09,992 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:09,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 296 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 02:44:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-14 02:44:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 123. [2024-11-14 02:44:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 62 states have (on average 1.935483870967742) internal successors, (120), 100 states have internal predecessors, (120), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (17), 17 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-14 02:44:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2024-11-14 02:44:10,012 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 19 [2024-11-14 02:44:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:10,012 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2024-11-14 02:44:10,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 02:44:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2024-11-14 02:44:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 02:44:10,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:10,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:10,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 02:44:10,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:10,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:10,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1695361527, now seen corresponding path program 1 times [2024-11-14 02:44:10,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:10,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604071113] [2024-11-14 02:44:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:10,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:10,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604071113] [2024-11-14 02:44:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604071113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:44:10,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:44:10,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 02:44:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328778624] [2024-11-14 02:44:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:44:10,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 02:44:10,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:10,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 02:44:10,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:44:10,589 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 02:44:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:11,265 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2024-11-14 02:44:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 02:44:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-11-14 02:44:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:11,272 INFO L225 Difference]: With dead ends: 153 [2024-11-14 02:44:11,272 INFO L226 Difference]: Without dead ends: 153 [2024-11-14 02:44:11,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-14 02:44:11,273 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 68 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:11,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 288 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 02:44:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-14 02:44:11,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 136. [2024-11-14 02:44:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 109 states have internal predecessors, (133), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (24), 21 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-14 02:44:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 174 transitions. [2024-11-14 02:44:11,283 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 174 transitions. Word has length 19 [2024-11-14 02:44:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:11,283 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 174 transitions. [2024-11-14 02:44:11,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 02:44:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2024-11-14 02:44:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 02:44:11,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:11,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:11,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 02:44:11,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:11,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:11,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1488960300, now seen corresponding path program 1 times [2024-11-14 02:44:11,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:11,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686834074] [2024-11-14 02:44:11,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:11,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:11,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:11,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686834074] [2024-11-14 02:44:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686834074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:11,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458715476] [2024-11-14 02:44:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:11,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:11,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:44:11,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:44:11,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 02:44:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:11,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 02:44:11,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:11,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:44:11,833 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-14 02:44:11,868 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:44:11,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 02:44:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 02:44:11,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:44:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458715476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:44:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [958985128] [2024-11-14 02:44:12,089 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 02:44:12,089 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:44:12,093 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:44:12,097 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:44:12,098 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:44:12,285 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 55 for LOIs [2024-11-14 02:44:12,814 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 99 for LOIs [2024-11-14 02:44:12,933 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:44:12,969 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:44:19,374 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1745#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (= create_internal_~now~0.offset 0) (= |create_internal_#t~ret7.offset| 0) (exists ((v_create_internal_~now~0.base_16 Int)) (and (or (and (exists ((|v_#valid_132| (Array Int Int)) (|v_#length_108| (Array Int Int)) (|v_#memory_$Pointer$.base_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| Int)) (and (= (select |v_#valid_132| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0) (= |old(#length)| (store |v_#length_108| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 24)) (= |old(#valid)| (store |v_#valid_132| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0) 16 0)) |old(#memory_$Pointer$.base)|) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 0)) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (store (select |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0) 16 0))))) (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#valid_133| (Array Int Int))) (= (select |v_#valid_133| create_internal_~sll~0.base) 0)) (exists ((|v_#valid_135| (Array Int Int))) (and (= (select |v_#valid_135| |create_internal_#t~ret7.base|) 0) (= (store |v_#valid_135| |create_internal_#t~ret7.base| 1) |#valid|))) (exists ((|v_#length_109| (Array Int Int))) (= |#length| (store |v_#length_109| |create_internal_#t~ret7.base| 8))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| 0) 0)) (= v_create_internal_~now~0.base_16 create_internal_~sll~0.base) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_create_internal_#t~nondet6_7| Int)) (and (not (= |v_create_internal_#t~nondet6_7| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_7| 2147483648)) (<= |v_create_internal_#t~nondet6_7| 2147483647))) (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_115| |create_internal_#t~ret7.base|) 0 0)))) (not (= create_internal_~sll~0.base 0)) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_115| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_115| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|))) (and (exists ((|v_#valid_132| (Array Int Int)) (|v_#length_108| (Array Int Int)) (|v_#memory_$Pointer$.base_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| Int)) (and (= (select |v_#valid_132| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0) (= |old(#length)| (store |v_#length_108| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 24)) (= |old(#valid)| (store |v_#valid_132| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0) 16 0)) |old(#memory_$Pointer$.base)|) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 0)) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (store (select |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0) 16 0))))) (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#length_109| (Array Int Int))) (= |#length| (store |v_#length_109| |create_internal_#t~ret7.base| 8))) (exists ((|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_116| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_116| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| 0) 0)) (= v_create_internal_~now~0.base_16 create_internal_~sll~0.base) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_create_internal_#t~nondet6_7| Int)) (and (not (= |v_create_internal_#t~nondet6_7| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_7| 2147483648)) (<= |v_create_internal_#t~nondet6_7| 2147483647))) (not (= create_internal_~sll~0.base 0)) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_134| (Array Int Int))) (= (select |v_#valid_134| create_internal_~sll~0.base) 0)) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_115| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_115| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_#valid_133| (Array Int Int))) (and (= (store |v_#valid_133| |create_internal_#t~ret7.base| 1) |#valid|) (= (select |v_#valid_133| |create_internal_#t~ret7.base|) 0))))) (not (= (select |#valid| v_create_internal_~now~0.base_16) 1)))))' at error location [2024-11-14 02:44:19,375 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:44:19,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:44:19,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 10 [2024-11-14 02:44:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123797753] [2024-11-14 02:44:19,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:44:19,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 02:44:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 02:44:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=615, Unknown=2, NotChecked=50, Total=756 [2024-11-14 02:44:19,378 INFO L87 Difference]: Start difference. First operand 136 states and 174 transitions. Second operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 02:44:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:20,188 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2024-11-14 02:44:20,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 02:44:20,189 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 21 [2024-11-14 02:44:20,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:20,190 INFO L225 Difference]: With dead ends: 148 [2024-11-14 02:44:20,190 INFO L226 Difference]: Without dead ends: 148 [2024-11-14 02:44:20,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=117, Invalid=877, Unknown=2, NotChecked=60, Total=1056 [2024-11-14 02:44:20,192 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 73 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:20,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 382 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 490 Invalid, 0 Unknown, 143 Unchecked, 0.5s Time] [2024-11-14 02:44:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-14 02:44:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 137. [2024-11-14 02:44:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 109 states have internal predecessors, (134), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-14 02:44:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 177 transitions. [2024-11-14 02:44:20,208 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 177 transitions. Word has length 21 [2024-11-14 02:44:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:20,215 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 177 transitions. [2024-11-14 02:44:20,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 02:44:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 177 transitions. [2024-11-14 02:44:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 02:44:20,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:20,216 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:20,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 02:44:20,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:20,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:20,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1488960301, now seen corresponding path program 1 times [2024-11-14 02:44:20,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:20,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348010654] [2024-11-14 02:44:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:20,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348010654] [2024-11-14 02:44:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348010654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974286535] [2024-11-14 02:44:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:44:20,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:44:20,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 02:44:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:20,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 02:44:20,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:20,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:44:20,936 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-14 02:44:20,953 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:44:20,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 02:44:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 02:44:20,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:44:21,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974286535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:21,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496831901] [2024-11-14 02:44:21,054 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 02:44:21,054 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:44:21,054 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:44:21,054 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:44:21,054 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:44:21,132 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 53 for LOIs [2024-11-14 02:44:21,411 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 95 for LOIs [2024-11-14 02:44:21,476 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:44:21,492 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:44:25,268 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2135#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (exists ((v_create_internal_~now~0.base_17 Int)) (and (<= (select |#length| v_create_internal_~now~0.base_17) 7) (or (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#valid_143| (Array Int Int))) (= (select |v_#valid_143| create_internal_~sll~0.base) 0)) (exists ((|v_#valid_144| (Array Int Int))) (and (= (store |v_#valid_144| |create_internal_#t~ret7.base| 1) |#valid|) (= (select |v_#valid_144| |create_internal_#t~ret7.base|) 0))) (exists ((|v_#length_123| (Array Int Int))) (= (store |v_#length_123| |create_internal_#t~ret7.base| 8) |#length|)) (exists ((|v_create_internal_#t~nondet6_8| Int)) (and (not (= |v_create_internal_#t~nondet6_8| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_8| 2147483648)) (<= |v_create_internal_#t~nondet6_8| 2147483647))) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_130| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 0) 0)) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#valid_142| (Array Int Int)) (|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| Int) (|v_#length_122| (Array Int Int))) (and (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0) 16 0)) |old(#memory_$Pointer$.base)|) (= (select |v_#valid_142| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0) (= |old(#valid)| (store |v_#valid_142| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1)) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 0)) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0) 16 0))) (= (store |v_#length_122| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 24) |old(#length)|) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|))) (not (= create_internal_~sll~0.base 0)) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (= v_create_internal_~now~0.base_17 create_internal_~sll~0.base) (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_130| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_130| |create_internal_#t~ret7.base|) 0 0))))) (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#valid_143| (Array Int Int))) (and (= |#valid| (store |v_#valid_143| |create_internal_#t~ret7.base| 1)) (= (select |v_#valid_143| |create_internal_#t~ret7.base|) 0))) (exists ((|v_#length_125| (Array Int Int))) (= (store |v_#length_125| |create_internal_#t~ret7.base| 8) |#length|)) (exists ((|v_#valid_145| (Array Int Int))) (= (select |v_#valid_145| create_internal_~sll~0.base) 0)) (exists ((|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_131| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_131| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_create_internal_#t~nondet6_8| Int)) (and (not (= |v_create_internal_#t~nondet6_8| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_8| 2147483648)) (<= |v_create_internal_#t~nondet6_8| 2147483647))) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_129| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_129| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 0) 0)) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#valid_142| (Array Int Int)) (|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| Int) (|v_#length_122| (Array Int Int))) (and (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0) 16 0)) |old(#memory_$Pointer$.base)|) (= (select |v_#valid_142| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0) (= |old(#valid)| (store |v_#valid_142| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1)) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 0)) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0) 16 0))) (= (store |v_#length_122| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 24) |old(#length)|) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|))) (not (= create_internal_~sll~0.base 0)) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (= v_create_internal_~now~0.base_17 create_internal_~sll~0.base))))) (= |create_internal_#t~ret7.offset| 0))' at error location [2024-11-14 02:44:25,268 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:44:25,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:44:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2024-11-14 02:44:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478479036] [2024-11-14 02:44:25,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:44:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 02:44:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 02:44:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=679, Unknown=1, NotChecked=52, Total=812 [2024-11-14 02:44:25,270 INFO L87 Difference]: Start difference. First operand 137 states and 177 transitions. Second operand has 10 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 02:44:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:25,920 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2024-11-14 02:44:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 02:44:25,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-11-14 02:44:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:25,922 INFO L225 Difference]: With dead ends: 138 [2024-11-14 02:44:25,922 INFO L226 Difference]: Without dead ends: 138 [2024-11-14 02:44:25,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=101, Invalid=894, Unknown=1, NotChecked=60, Total=1056 [2024-11-14 02:44:25,924 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 26 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:25,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 338 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 471 Invalid, 0 Unknown, 130 Unchecked, 0.5s Time] [2024-11-14 02:44:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-14 02:44:25,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-14 02:44:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 110 states have internal predecessors, (134), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-14 02:44:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 177 transitions. [2024-11-14 02:44:25,933 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 177 transitions. Word has length 21 [2024-11-14 02:44:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:25,933 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 177 transitions. [2024-11-14 02:44:25,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 02:44:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 177 transitions. [2024-11-14 02:44:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 02:44:25,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:25,935 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:25,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 02:44:26,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:26,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:26,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1607085454, now seen corresponding path program 1 times [2024-11-14 02:44:26,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:26,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122884526] [2024-11-14 02:44:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 02:44:26,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:26,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122884526] [2024-11-14 02:44:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122884526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:26,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091124595] [2024-11-14 02:44:26,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:26,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:26,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:44:26,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:44:26,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 02:44:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:26,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 02:44:26,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:26,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:44:27,080 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-14 02:44:27,114 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)) |v_#valid_BEFORE_CALL_40|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2024-11-14 02:44:27,117 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)) |v_#valid_BEFORE_CALL_40|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-11-14 02:44:27,142 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2024-11-14 02:44:27,145 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2024-11-14 02:44:27,232 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:44:27,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 02:44:27,255 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_23| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0))) (= (select |c_#valid| .cse0) 1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from false [2024-11-14 02:44:27,259 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_23| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0))) (= (select |c_#valid| .cse0) 1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from true [2024-11-14 02:44:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-14 02:44:27,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:44:27,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091124595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:27,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1611864598] [2024-11-14 02:44:27,548 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 02:44:27,548 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:44:27,549 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:44:27,549 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:44:27,549 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:44:28,391 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 57 for LOIs [2024-11-14 02:44:29,394 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2024-11-14 02:44:29,421 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:44:29,436 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:44:35,985 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2562#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#t~ret10#1.offset| 0) (exists ((|v_ULTIMATE.start_create_~now~1#1.base_37| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_create_~now~1#1.base_37|) 1)) (or (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_175| (Array Int Int)) (|v_#memory_$Pointer$.base_156| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_156| (Array Int (Array Int Int))) (v_create_internal_~now~0.base_26 Int) (|v_#length_144| (Array Int Int)) (v_create_internal_~now~0.offset_23 Int)) (and (<= (+ v_create_internal_~now~0.offset_23 8) (select |#length| v_create_internal_~now~0.base_26)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23) (store (select |v_#memory_$Pointer$.offset_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23)) 0 0)) v_create_internal_~now~0.base_26 (store (select (store |v_#memory_$Pointer$.offset_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23) (store (select |v_#memory_$Pointer$.offset_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23)) 0 0)) v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23 0))) (= (store (store |v_#memory_$Pointer$.base_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23) (store (select |v_#memory_$Pointer$.base_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23)) 0 0)) v_create_internal_~now~0.base_26 (store (select (store |v_#memory_$Pointer$.base_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23) (store (select |v_#memory_$Pointer$.base_156| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23)) 0 0)) v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23 (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23))) |#memory_$Pointer$.base|) (= (store |v_#valid_175| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23) 1) |#valid|) (not (= (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23) 0)) (= |#length| (store |v_#length_144| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23) 8)) (= (select |#valid| v_create_internal_~now~0.base_26) 1) (<= 0 v_create_internal_~now~0.offset_23) (<= (+ (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23) 1) |#StackHeapBarrier|) (= (select |v_#valid_175| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_26) v_create_internal_~now~0.offset_23)) 0))) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_174| (Array Int Int))) (= (select |v_#valid_174| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (= |v_ULTIMATE.start_create_~now~1#1.base_37| |ULTIMATE.start_create_~sll~1#1.base|)) (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (not (= |ULTIMATE.start_create_#t~ret10#1.base| 0)) (exists ((|v_#valid_175| (Array Int Int))) (and (= |#valid| (store |v_#valid_175| |ULTIMATE.start_create_#t~ret10#1.base| 1)) (= (select |v_#valid_175| |ULTIMATE.start_create_#t~ret10#1.base|) 0))) (exists ((|v_#length_144| (Array Int Int))) (= |#length| (store |v_#length_144| |ULTIMATE.start_create_#t~ret10#1.base| 8))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_174| (Array Int Int))) (= (select |v_#valid_174| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (exists ((|v_#memory_$Pointer$.offset_156| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_156| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.offset_156| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)))) (exists ((|v_#memory_$Pointer$.base_156| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_156| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.base_156| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_create_#t~ret10#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_create_~now~1#1.base_37| |ULTIMATE.start_create_~sll~1#1.base|))))) (= |ULTIMATE.start_create_~now~1#1.offset| 0) (= |ULTIMATE.start_create_~sll~1#1.offset| 0))' at error location [2024-11-14 02:44:35,986 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:44:35,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:44:35,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 17 [2024-11-14 02:44:35,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212136146] [2024-11-14 02:44:35,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:44:35,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 02:44:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:35,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 02:44:35,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1222, Unknown=8, NotChecked=300, Total=1722 [2024-11-14 02:44:35,988 INFO L87 Difference]: Start difference. First operand 138 states and 177 transitions. Second operand has 18 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 02:44:36,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)) |v_#valid_BEFORE_CALL_40|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2024-11-14 02:44:36,413 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)) |v_#valid_BEFORE_CALL_40|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2024-11-14 02:44:36,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2024-11-14 02:44:36,425 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)) |v_#valid_BEFORE_CALL_40|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2024-11-14 02:44:36,436 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1))) (= (select |c_#valid| .cse1) 1)))))) (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))))) is different from false [2024-11-14 02:44:36,439 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_23| |v_#valid_BEFORE_CALL_40|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_40| (store |v_old(#valid)_AFTER_CALL_23| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1))) (= (select |c_#valid| .cse1) 1)))))) (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))))) is different from true [2024-11-14 02:44:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:37,253 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2024-11-14 02:44:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 02:44:37,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2024-11-14 02:44:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:37,256 INFO L225 Difference]: With dead ends: 161 [2024-11-14 02:44:37,256 INFO L226 Difference]: Without dead ends: 161 [2024-11-14 02:44:37,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=268, Invalid=1638, Unknown=14, NotChecked=630, Total=2550 [2024-11-14 02:44:37,258 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 114 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 874 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:37,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 429 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 759 Invalid, 0 Unknown, 874 Unchecked, 0.9s Time] [2024-11-14 02:44:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-14 02:44:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 143. [2024-11-14 02:44:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 77 states have (on average 1.8181818181818181) internal successors, (140), 114 states have internal predecessors, (140), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 23 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-14 02:44:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 190 transitions. [2024-11-14 02:44:37,282 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 190 transitions. Word has length 27 [2024-11-14 02:44:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:37,282 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 190 transitions. [2024-11-14 02:44:37,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 02:44:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 190 transitions. [2024-11-14 02:44:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 02:44:37,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:37,283 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:37,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 02:44:37,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:37,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:37,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:37,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1607085455, now seen corresponding path program 1 times [2024-11-14 02:44:37,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:37,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811149125] [2024-11-14 02:44:37,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:37,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:44:38,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:38,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811149125] [2024-11-14 02:44:38,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811149125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:38,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053242888] [2024-11-14 02:44:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:38,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:38,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:44:38,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:44:38,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 02:44:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:38,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 02:44:38,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:38,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 02:44:38,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:44:38,676 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-14 02:44:38,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:44:38,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:44:38,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-11-14 02:44:38,846 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-14 02:44:38,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-14 02:44:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-14 02:44:38,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:44:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053242888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [266393350] [2024-11-14 02:44:39,151 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 02:44:39,151 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:44:39,151 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:44:39,151 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:44:39,151 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:44:40,067 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 57 for LOIs [2024-11-14 02:44:41,211 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2024-11-14 02:44:41,240 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:44:41,256 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:44:46,090 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3012#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#t~ret10#1.offset| 0) (exists ((|v_ULTIMATE.start_create_~now~1#1.base_38| Int)) (and (<= (select |#length| |v_ULTIMATE.start_create_~now~1#1.base_38|) 15) (or (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (exists ((|v_#length_172| (Array Int Int)) (|v_#valid_202| (Array Int Int)) (v_create_internal_~now~0.offset_35 Int) (|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_188| (Array Int (Array Int Int))) (v_create_internal_~now~0.base_38 Int)) (and (= (select |#valid| v_create_internal_~now~0.base_38) 1) (= (store |v_#length_172| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35) 8) |#length|) (<= 0 v_create_internal_~now~0.offset_35) (= (store (store |v_#memory_$Pointer$.base_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35) (store (select |v_#memory_$Pointer$.base_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35)) 0 0)) v_create_internal_~now~0.base_38 (store (select (store |v_#memory_$Pointer$.base_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35) (store (select |v_#memory_$Pointer$.base_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35)) 0 0)) v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35 (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35))) |#memory_$Pointer$.base|) (<= (+ (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35) (store (select |v_#memory_$Pointer$.offset_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35)) 0 0)) v_create_internal_~now~0.base_38 (store (select (store |v_#memory_$Pointer$.offset_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35) (store (select |v_#memory_$Pointer$.offset_188| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35)) 0 0)) v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35 0))) (= (store |v_#valid_202| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35) 1) |#valid|) (<= (+ v_create_internal_~now~0.offset_35 8) (select |#length| v_create_internal_~now~0.base_38)) (not (= (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35) 0)) (= (select |v_#valid_202| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_38) v_create_internal_~now~0.offset_35)) 0))) (= |v_ULTIMATE.start_create_~now~1#1.base_38| |ULTIMATE.start_create_~sll~1#1.base|) (exists ((|v_#valid_201| (Array Int Int))) (= (select |v_#valid_201| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0)) (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_202| (Array Int Int))) (and (= (select |v_#valid_202| |ULTIMATE.start_create_#t~ret10#1.base|) 0) (= (store |v_#valid_202| |ULTIMATE.start_create_#t~ret10#1.base| 1) |#valid|))) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (not (= |ULTIMATE.start_create_#t~ret10#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_188| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.offset_188| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)))) (= |v_ULTIMATE.start_create_~now~1#1.base_38| |ULTIMATE.start_create_~sll~1#1.base|) (exists ((|v_#valid_201| (Array Int Int))) (= (select |v_#valid_201| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#length_172| (Array Int Int))) (= |#length| (store |v_#length_172| |ULTIMATE.start_create_#t~ret10#1.base| 8))) (<= (+ |ULTIMATE.start_create_#t~ret10#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_188| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_188| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.base_188| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)) |#memory_$Pointer$.base|)))))) (= |ULTIMATE.start_create_~sll~1#1.offset| 0))' at error location [2024-11-14 02:44:46,090 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:44:46,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:44:46,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2024-11-14 02:44:46,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370509778] [2024-11-14 02:44:46,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:44:46,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 02:44:46,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:46,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 02:44:46,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1543, Unknown=2, NotChecked=80, Total=1806 [2024-11-14 02:44:46,100 INFO L87 Difference]: Start difference. First operand 143 states and 190 transitions. Second operand has 20 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-14 02:44:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:47,239 INFO L93 Difference]: Finished difference Result 182 states and 245 transitions. [2024-11-14 02:44:47,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 02:44:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 27 [2024-11-14 02:44:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:47,242 INFO L225 Difference]: With dead ends: 182 [2024-11-14 02:44:47,243 INFO L226 Difference]: Without dead ends: 182 [2024-11-14 02:44:47,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=200, Invalid=1694, Unknown=2, NotChecked=84, Total=1980 [2024-11-14 02:44:47,244 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 94 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 55 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:47,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 290 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 904 Invalid, 5 Unknown, 196 Unchecked, 1.0s Time] [2024-11-14 02:44:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-14 02:44:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 147. [2024-11-14 02:44:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 81 states have (on average 1.8518518518518519) internal successors, (150), 116 states have internal predecessors, (150), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-14 02:44:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 200 transitions. [2024-11-14 02:44:47,258 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 200 transitions. Word has length 27 [2024-11-14 02:44:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:47,258 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 200 transitions. [2024-11-14 02:44:47,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-14 02:44:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2024-11-14 02:44:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 02:44:47,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:47,259 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:47,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 02:44:47,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:47,460 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1739966268, now seen corresponding path program 1 times [2024-11-14 02:44:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451914954] [2024-11-14 02:44:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:44:47,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:47,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451914954] [2024-11-14 02:44:47,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451914954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:47,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126365316] [2024-11-14 02:44:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:47,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:47,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:44:47,764 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:44:47,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 02:44:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:47,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 02:44:47,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:47,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:44:47,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:44:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 02:44:47,928 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-14 02:44:47,943 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:44:47,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 02:44:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-14 02:44:47,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:44:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:44:48,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126365316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:44:48,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [560726397] [2024-11-14 02:44:48,092 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 02:44:48,092 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:44:48,092 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:44:48,092 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:44:48,092 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:44:48,142 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 55 for LOIs [2024-11-14 02:44:49,059 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2024-11-14 02:44:49,085 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:44:49,100 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:44:56,003 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3548#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (exists ((|v_#valid_232| (Array Int Int))) (and (= (store |v_#valid_232| |create_internal_#t~ret7.base| 1) |#valid|) (= (select |v_#valid_232| |create_internal_#t~ret7.base|) 0))) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_#memory_$Pointer$.base_228| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_228| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_228| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_#memory_$Pointer$.offset_227| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_227| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_227| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_#length_196| (Array Int Int))) (= |#length| (store |v_#length_196| |create_internal_#t~ret7.base| 8))) (= |create_internal_#t~ret7.offset| 0) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((v_create_internal_~now~0.base_49 Int)) (not (= 1 (select |#valid| v_create_internal_~now~0.base_49)))))' at error location [2024-11-14 02:44:56,003 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:44:56,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:44:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 11 [2024-11-14 02:44:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059787679] [2024-11-14 02:44:56,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:44:56,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 02:44:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 02:44:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=767, Unknown=3, NotChecked=56, Total=930 [2024-11-14 02:44:56,006 INFO L87 Difference]: Start difference. First operand 147 states and 200 transitions. Second operand has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 02:44:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:56,742 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2024-11-14 02:44:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 02:44:56,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 29 [2024-11-14 02:44:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:56,745 INFO L225 Difference]: With dead ends: 157 [2024-11-14 02:44:56,745 INFO L226 Difference]: Without dead ends: 157 [2024-11-14 02:44:56,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=138, Invalid=1123, Unknown=3, NotChecked=68, Total=1332 [2024-11-14 02:44:56,746 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 95 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:56,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 424 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 549 Invalid, 0 Unknown, 141 Unchecked, 0.5s Time] [2024-11-14 02:44:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-14 02:44:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-11-14 02:44:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 81 states have (on average 1.8395061728395061) internal successors, (149), 115 states have internal predecessors, (149), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-14 02:44:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2024-11-14 02:44:56,760 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 29 [2024-11-14 02:44:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:56,762 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2024-11-14 02:44:56,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 02:44:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2024-11-14 02:44:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 02:44:56,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:56,763 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:56,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 02:44:56,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:56,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:44:56,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1739966267, now seen corresponding path program 1 times [2024-11-14 02:44:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:56,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816041966] [2024-11-14 02:44:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:44:57,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816041966] [2024-11-14 02:44:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816041966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171578004] [2024-11-14 02:44:57,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:57,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:44:57,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:44:57,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 02:44:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:57,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 02:44:57,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:57,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:44:57,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:44:57,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:44:57,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 02:44:57,727 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-14 02:44:57,745 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:44:57,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 02:44:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-14 02:44:57,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:44:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171578004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:57,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [699584325] [2024-11-14 02:44:57,856 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-14 02:44:57,856 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:44:57,857 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:44:57,857 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:44:57,857 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:44:57,917 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 53 for LOIs [2024-11-14 02:44:58,734 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2024-11-14 02:44:58,767 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:44:58,783 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:45:01,674 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3991#(and (= create_internal_~sll~0.offset 0) (exists ((|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_246| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_246| |create_internal_#t~ret7.base|) 0 0)))) (<= 1 |#StackHeapBarrier|) (exists ((|v_#length_210| (Array Int Int))) (= (store |v_#length_210| |create_internal_#t~ret7.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_247| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_247| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_247| |create_internal_#t~ret7.base|) 0 0)))) (not (= |create_internal_#t~ret7.base| 0)) (= |create_internal_#t~ret7.offset| 0) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_242| (Array Int Int))) (and (= (select |v_#valid_242| |create_internal_#t~ret7.base|) 0) (= (store |v_#valid_242| |create_internal_#t~ret7.base| 1) |#valid|))))' at error location [2024-11-14 02:45:01,675 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:45:01,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:45:01,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2024-11-14 02:45:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271324123] [2024-11-14 02:45:01,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:45:01,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 02:45:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:45:01,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 02:45:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1072, Unknown=1, NotChecked=66, Total=1260 [2024-11-14 02:45:01,678 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand has 16 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 02:45:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:45:02,458 INFO L93 Difference]: Finished difference Result 155 states and 210 transitions. [2024-11-14 02:45:02,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 02:45:02,458 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2024-11-14 02:45:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:45:02,460 INFO L225 Difference]: With dead ends: 155 [2024-11-14 02:45:02,460 INFO L226 Difference]: Without dead ends: 155 [2024-11-14 02:45:02,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=148, Invalid=1337, Unknown=1, NotChecked=74, Total=1560 [2024-11-14 02:45:02,461 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 68 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 02:45:02,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 417 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 756 Invalid, 0 Unknown, 140 Unchecked, 0.6s Time] [2024-11-14 02:45:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-14 02:45:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2024-11-14 02:45:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 81 states have (on average 1.8148148148148149) internal successors, (147), 113 states have internal predecessors, (147), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-14 02:45:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 197 transitions. [2024-11-14 02:45:02,469 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 197 transitions. Word has length 29 [2024-11-14 02:45:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:45:02,470 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 197 transitions. [2024-11-14 02:45:02,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 02:45:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 197 transitions. [2024-11-14 02:45:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 02:45:02,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:45:02,471 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:45:02,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 02:45:02,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:45:02,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:45:02,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:45:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash -29864350, now seen corresponding path program 1 times [2024-11-14 02:45:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:45:02,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097540404] [2024-11-14 02:45:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:45:02,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:45:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:45:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 02:45:02,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:45:02,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097540404] [2024-11-14 02:45:02,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097540404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:45:02,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:45:02,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:45:02,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484148464] [2024-11-14 02:45:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:45:02,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:45:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:45:02,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:45:02,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:45:02,760 INFO L87 Difference]: Start difference. First operand 144 states and 197 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 02:45:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:45:02,988 INFO L93 Difference]: Finished difference Result 165 states and 238 transitions. [2024-11-14 02:45:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 02:45:02,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-14 02:45:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:45:02,990 INFO L225 Difference]: With dead ends: 165 [2024-11-14 02:45:02,990 INFO L226 Difference]: Without dead ends: 165 [2024-11-14 02:45:02,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:45:02,990 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 21 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:45:02,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 236 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:45:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-14 02:45:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2024-11-14 02:45:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 95 states have (on average 1.8631578947368421) internal successors, (177), 123 states have internal predecessors, (177), 20 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (38), 29 states have call predecessors, (38), 20 states have call successors, (38) [2024-11-14 02:45:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 235 transitions. [2024-11-14 02:45:02,998 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 235 transitions. Word has length 35 [2024-11-14 02:45:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:45:02,999 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 235 transitions. [2024-11-14 02:45:02,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 02:45:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 235 transitions. [2024-11-14 02:45:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 02:45:03,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:45:03,000 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:45:03,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 02:45:03,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:45:03,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:45:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash -29864349, now seen corresponding path program 1 times [2024-11-14 02:45:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:45:03,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111559336] [2024-11-14 02:45:03,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:45:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:45:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:45:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 02:45:03,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:45:03,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111559336] [2024-11-14 02:45:03,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111559336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:45:03,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:45:03,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 02:45:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881551441] [2024-11-14 02:45:03,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:45:03,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 02:45:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:45:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 02:45:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 02:45:03,194 INFO L87 Difference]: Start difference. First operand 158 states and 235 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 02:45:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:45:03,505 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2024-11-14 02:45:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 02:45:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-14 02:45:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:45:03,507 INFO L225 Difference]: With dead ends: 171 [2024-11-14 02:45:03,507 INFO L226 Difference]: Without dead ends: 171 [2024-11-14 02:45:03,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:45:03,508 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 18 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:45:03,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 485 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:45:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-14 02:45:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2024-11-14 02:45:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.8137254901960784) internal successors, (185), 130 states have internal predecessors, (185), 22 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (40), 31 states have call predecessors, (40), 22 states have call successors, (40) [2024-11-14 02:45:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2024-11-14 02:45:03,518 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 35 [2024-11-14 02:45:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:45:03,518 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2024-11-14 02:45:03,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 02:45:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2024-11-14 02:45:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 02:45:03,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:45:03,520 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:45:03,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 02:45:03,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:45:03,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:45:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash 176071547, now seen corresponding path program 1 times [2024-11-14 02:45:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:45:03,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964769892] [2024-11-14 02:45:03,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:45:03,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:45:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:45:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 02:45:03,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:45:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964769892] [2024-11-14 02:45:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964769892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:45:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002521222] [2024-11-14 02:45:03,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:45:03,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:45:03,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:45:03,953 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:45:03,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 02:45:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:45:04,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 02:45:04,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:45:04,169 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-14 02:45:04,189 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_113|))) (and (= .cse0 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_113| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_113| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2024-11-14 02:45:04,193 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_113|))) (and (= .cse0 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_113| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_113| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-11-14 02:45:04,214 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_113|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_113| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_113| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2024-11-14 02:45:04,217 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_113|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_113| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_113| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2024-11-14 02:45:04,315 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:45:04,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 02:45:04,336 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_114| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_114| |v_old(#valid)_AFTER_CALL_113|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_113| (store |v_old(#valid)_AFTER_CALL_114| .cse0 (select |v_old(#valid)_AFTER_CALL_113| .cse0)))))) (= (select |v_old(#valid)_AFTER_CALL_114| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2024-11-14 02:45:04,339 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_114| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_114| |v_old(#valid)_AFTER_CALL_113|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_113| (store |v_old(#valid)_AFTER_CALL_114| .cse0 (select |v_old(#valid)_AFTER_CALL_113| .cse0)))))) (= (select |v_old(#valid)_AFTER_CALL_114| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2024-11-14 02:45:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-14 02:45:04,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:45:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002521222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:45:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1803600126] [2024-11-14 02:45:04,570 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 02:45:04,570 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:45:04,570 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:45:04,570 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:45:04,570 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:45:05,518 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 161 for LOIs [2024-11-14 02:45:06,472 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 3 for LOIs [2024-11-14 02:45:06,477 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:45:06,489 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:45:11,420 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5150#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_create_~now~1#1.base_39| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_~now~1#1.base_39|) 1))) (= |ULTIMATE.start_create_#t~ret11#1.offset| 0) (= |ULTIMATE.start_create_~now~1#1.offset| 0) (= |ULTIMATE.start_create_~sll~1#1.offset| 0))' at error location [2024-11-14 02:45:11,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:45:11,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:45:11,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2024-11-14 02:45:11,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144801292] [2024-11-14 02:45:11,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:45:11,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 02:45:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:45:11,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 02:45:11,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1092, Unknown=7, NotChecked=284, Total=1560 [2024-11-14 02:45:11,422 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand has 15 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 02:45:11,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_113|))) (and (= .cse0 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_113| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_113| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2024-11-14 02:45:11,937 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_113|))) (and (= .cse0 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_113| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_113| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2024-11-14 02:45:11,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_113|))) (and (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_113| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_113| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2024-11-14 02:45:11,950 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_113|))) (and (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_113| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_113| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2024-11-14 02:45:12,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_114| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_114| |v_old(#valid)_AFTER_CALL_113|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_113| (store |v_old(#valid)_AFTER_CALL_114| .cse1 (select |v_old(#valid)_AFTER_CALL_113| .cse1)))))) (= (select |v_old(#valid)_AFTER_CALL_114| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from false [2024-11-14 02:45:12,383 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_114| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_113| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_114| |v_old(#valid)_AFTER_CALL_113|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_113| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_113| (store |v_old(#valid)_AFTER_CALL_114| .cse1 (select |v_old(#valid)_AFTER_CALL_113| .cse1)))))) (= (select |v_old(#valid)_AFTER_CALL_114| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from true [2024-11-14 02:45:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:45:12,592 INFO L93 Difference]: Finished difference Result 192 states and 275 transitions. [2024-11-14 02:45:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 02:45:12,594 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 38 [2024-11-14 02:45:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:45:12,596 INFO L225 Difference]: With dead ends: 192 [2024-11-14 02:45:12,596 INFO L226 Difference]: Without dead ends: 192 [2024-11-14 02:45:12,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=227, Invalid=1348, Unknown=13, NotChecked=574, Total=2162 [2024-11-14 02:45:12,597 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 785 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 02:45:12,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 331 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 550 Invalid, 0 Unknown, 785 Unchecked, 0.7s Time] [2024-11-14 02:45:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-14 02:45:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 166. [2024-11-14 02:45:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 101 states have (on average 1.811881188118812) internal successors, (183), 130 states have internal predecessors, (183), 22 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (40), 30 states have call predecessors, (40), 22 states have call successors, (40) [2024-11-14 02:45:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2024-11-14 02:45:12,620 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 38 [2024-11-14 02:45:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:45:12,620 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2024-11-14 02:45:12,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 02:45:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-11-14 02:45:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 02:45:12,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:45:12,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:45:12,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 02:45:12,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 02:45:12,823 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:45:12,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:45:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash -925645993, now seen corresponding path program 1 times [2024-11-14 02:45:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:45:12,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055885636] [2024-11-14 02:45:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:45:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:45:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:45:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 02:45:12,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:45:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055885636] [2024-11-14 02:45:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055885636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:45:12,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:45:12,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 02:45:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356541918] [2024-11-14 02:45:12,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:45:12,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 02:45:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:45:12,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 02:45:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:45:12,930 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 02:45:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:45:13,085 INFO L93 Difference]: Finished difference Result 174 states and 257 transitions. [2024-11-14 02:45:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:45:13,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-14 02:45:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:45:13,088 INFO L225 Difference]: With dead ends: 174 [2024-11-14 02:45:13,088 INFO L226 Difference]: Without dead ends: 174 [2024-11-14 02:45:13,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:45:13,089 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 27 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:45:13,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 497 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:45:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-14 02:45:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2024-11-14 02:45:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.7843137254901962) internal successors, (182), 131 states have internal predecessors, (182), 22 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (40), 30 states have call predecessors, (40), 22 states have call successors, (40) [2024-11-14 02:45:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2024-11-14 02:45:13,102 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 36 [2024-11-14 02:45:13,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:45:13,102 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2024-11-14 02:45:13,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 02:45:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2024-11-14 02:45:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 02:45:13,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:45:13,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:45:13,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 02:45:13,104 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:45:13,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:45:13,105 INFO L85 PathProgramCache]: Analyzing trace with hash 594942246, now seen corresponding path program 2 times [2024-11-14 02:45:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:45:13,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761287843] [2024-11-14 02:45:13,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:45:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:45:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:45:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 02:45:14,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:45:14,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761287843] [2024-11-14 02:45:14,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761287843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:45:14,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500956626] [2024-11-14 02:45:14,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:45:14,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:45:14,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:45:14,420 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:45:14,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 02:45:14,622 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 02:45:14,622 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:45:14,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 02:45:14,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:45:14,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:45:14,881 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (= |c_#valid| (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2))))) (or (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|))) (and (= .cse0 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse1 (select |c_#valid| .cse1))) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_276| .cse0))) (= .cse1 |c_create_internal_#t~ret7.base|)))) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse2)) .cse3) (and (= .cse2 |c_create_internal_#t~ret7.base|) .cse3)))) is different from false [2024-11-14 02:45:14,885 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (= |c_#valid| (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2))))) (or (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|))) (and (= .cse0 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse1 (select |c_#valid| .cse1))) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_276| .cse0))) (= .cse1 |c_create_internal_#t~ret7.base|)))) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse2)) .cse3) (and (= .cse2 |c_create_internal_#t~ret7.base|) .cse3)))) is different from true [2024-11-14 02:45:14,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:45:14,933 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (= |c_#valid| (store |c_old(#valid)| .cse0 (select |c_#valid| .cse0)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))) (or (and (= .cse0 .cse1) .cse2) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse0)) .cse2) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= .cse3 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse4 (select |c_#valid| .cse4))) (= .cse4 .cse1) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_276| .cse3))))))))) (= (select |c_#valid| c_create_internal_~now~0.base) 1)) is different from false [2024-11-14 02:45:14,937 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (= |c_#valid| (store |c_old(#valid)| .cse0 (select |c_#valid| .cse0)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))) (or (and (= .cse0 .cse1) .cse2) (and (or (= |c_#valid| |c_old(#valid)|) (= c_create_internal_~now~0.base .cse0)) .cse2) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= .cse3 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse4 (select |c_#valid| .cse4))) (= .cse4 .cse1) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_276| .cse3))))))))) (= (select |c_#valid| c_create_internal_~now~0.base) 1)) is different from true [2024-11-14 02:45:14,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2024-11-14 02:45:15,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse3))) (let ((.cse0 (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1))) (.cse2 (= |c_#valid| (store |c_old(#valid)| .cse3 .cse1)))) (or (and (or (and .cse0 (= |c_#valid| |c_old(#valid)|)) (= .cse1 1)) .cse2) (and .cse0 .cse2 (= c_create_internal_~now~0.base .cse3)) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse5 (select |c_#valid| .cse5))) (= .cse5 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_276| .cse4)))))))))) is different from false [2024-11-14 02:45:15,016 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse3))) (let ((.cse0 (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1))) (.cse2 (= |c_#valid| (store |c_old(#valid)| .cse3 .cse1)))) (or (and (or (and .cse0 (= |c_#valid| |c_old(#valid)|)) (= .cse1 1)) .cse2) (and .cse0 .cse2 (= c_create_internal_~now~0.base .cse3)) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse5 (select |c_#valid| .cse5))) (= .cse5 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_276| .cse4)))))))))) is different from true [2024-11-14 02:45:15,114 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-14 02:45:15,214 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_68) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|))) (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_278| .cse0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |v_#valid_BEFORE_CALL_278| .cse1) 1) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse2 (select |v_#valid_BEFORE_CALL_278| .cse2))) (= .cse2 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_276| .cse1))))))))) is different from false [2024-11-14 02:45:15,219 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_68) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|))) (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_278| .cse0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |v_#valid_BEFORE_CALL_278| .cse1) 1) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse2 (select |v_#valid_BEFORE_CALL_278| .cse2))) (= .cse2 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_276| .cse1))))))))) is different from true [2024-11-14 02:45:15,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (v_create_internal_~now~0.base_68 Int)) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_278| .cse0)))))) (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_68) 1)) .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|) 1)))) .cse1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_278| .cse3) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse2 (select |v_#valid_BEFORE_CALL_278| .cse2))) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_276| .cse3)))))))) is different from false [2024-11-14 02:45:15,326 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (v_create_internal_~now~0.base_68 Int)) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_278| .cse0)))))) (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_68) 1)) .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|) 1)))) .cse1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_278| .cse3) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse2 (select |v_#valid_BEFORE_CALL_278| .cse2))) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_276| .cse3)))))))) is different from true [2024-11-14 02:45:15,544 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-11-14 02:45:15,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2024-11-14 02:45:15,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1)) (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_279| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_276| (store |v_#valid_BEFORE_CALL_279| .cse2 (select |v_#valid_BEFORE_CALL_276| .cse2))) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse1 (select |v_#valid_BEFORE_CALL_278| .cse1))) (= (select |v_#valid_BEFORE_CALL_278| .cse2) 1)))) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_279| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (v_create_internal_~now~0.base_68 Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_278|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_279| .cse3 (select |v_#valid_BEFORE_CALL_278| .cse3))) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1) (= (select |c_#valid| .cse3) 1)))) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_279| (Array Int Int)) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_279| (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_278|) 1)))) .cse0))) is different from false [2024-11-14 02:45:15,726 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1)) (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_279| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_276| (store |v_#valid_BEFORE_CALL_279| .cse2 (select |v_#valid_BEFORE_CALL_276| .cse2))) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse1 (select |v_#valid_BEFORE_CALL_278| .cse1))) (= (select |v_#valid_BEFORE_CALL_278| .cse2) 1)))) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_279| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (v_create_internal_~now~0.base_68 Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_278|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_279| .cse3 (select |v_#valid_BEFORE_CALL_278| .cse3))) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1) (= (select |c_#valid| .cse3) 1)))) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_279| (Array Int Int)) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_279| (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_278|) 1)))) .cse0))) is different from true [2024-11-14 02:45:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 13 not checked. [2024-11-14 02:45:15,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:45:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500956626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:45:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [559104617] [2024-11-14 02:45:16,082 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 02:45:16,083 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:45:16,083 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:45:16,083 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:45:16,083 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:45:16,704 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 57 for LOIs [2024-11-14 02:45:17,419 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2024-11-14 02:45:17,441 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:45:17,454 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:45:26,708 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6052#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#t~ret10#1.offset| 0) (= |ULTIMATE.start_create_~now~1#1.offset| 0) (= |ULTIMATE.start_create_~sll~1#1.offset| 0) (exists ((|v_ULTIMATE.start_create_~now~1#1.base_40| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_create_~now~1#1.base_40|) 1)) (or (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_311| (Array Int Int))) (= (select |v_#valid_311| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (exists ((|v_#valid_312| (Array Int Int))) (and (= (store |v_#valid_312| |ULTIMATE.start_create_#t~ret10#1.base| 1) |#valid|) (= (select |v_#valid_312| |ULTIMATE.start_create_#t~ret10#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_319| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.base_319| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)) |#memory_$Pointer$.base|)) (= |v_ULTIMATE.start_create_~now~1#1.base_40| |ULTIMATE.start_create_~sll~1#1.base|) (not (= |ULTIMATE.start_create_#t~ret10#1.base| 0)) (exists ((|v_#length_256| (Array Int Int))) (= |#length| (store |v_#length_256| |ULTIMATE.start_create_#t~ret10#1.base| 8))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.offset_317| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_317| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.offset_317| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)))) (<= (+ |ULTIMATE.start_create_#t~ret10#1.base| 1) |#StackHeapBarrier|)) (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_311| (Array Int Int))) (= (select |v_#valid_311| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (= |v_ULTIMATE.start_create_~now~1#1.base_40| |ULTIMATE.start_create_~sll~1#1.base|) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_317| (Array Int (Array Int Int))) (|v_#valid_312| (Array Int Int)) (v_create_internal_~now~0.offset_72 Int) (|v_#length_256| (Array Int Int)) (v_create_internal_~now~0.base_78 Int)) (and (= 1 (select |#valid| v_create_internal_~now~0.base_78)) (<= 0 v_create_internal_~now~0.offset_72) (= (store (store |v_#memory_$Pointer$.base_319| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72) (store (select |v_#memory_$Pointer$.base_319| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72)) 0 0)) v_create_internal_~now~0.base_78 (store (select (store |v_#memory_$Pointer$.base_319| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72) (store (select |v_#memory_$Pointer$.base_319| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72)) 0 0)) v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72 (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72))) |#memory_$Pointer$.base|) (not (= (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72) 0)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_317| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72) (store (select |v_#memory_$Pointer$.offset_317| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72)) 0 0)) v_create_internal_~now~0.base_78 (store (select (store |v_#memory_$Pointer$.offset_317| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72) (store (select |v_#memory_$Pointer$.offset_317| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72)) 0 0)) v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72 0))) (<= (+ v_create_internal_~now~0.offset_72 8) (select |#length| v_create_internal_~now~0.base_78)) (= (select |v_#valid_312| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72)) 0) (= (store |v_#length_256| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72) 8) |#length|) (<= (+ (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72) 1) |#StackHeapBarrier|) (= (store |v_#valid_312| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_78) v_create_internal_~now~0.offset_72) 1) |#valid|))))))))' at error location [2024-11-14 02:45:26,709 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:45:26,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:45:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 25 [2024-11-14 02:45:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78676111] [2024-11-14 02:45:26,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:45:26,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 02:45:26,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:45:26,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 02:45:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1549, Unknown=14, NotChecked=616, Total=2450 [2024-11-14 02:45:26,711 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand has 26 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-14 02:45:27,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse12))) (let ((.cse17 (store |c_old(#valid)| .cse12 .cse3))) (let ((.cse10 (@diff .cse17 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse10))) (let ((.cse11 (store .cse17 .cse10 .cse4))) (let ((.cse8 (@diff .cse11 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse8)) (.cse13 (select (select |c_#memory_$Pointer$.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse5 (= (select |c_old(#valid)| .cse10) 0)) (.cse1 (= .cse12 |c_create_internal_#t~ret7.base|)) (.cse6 (= |c_#valid| .cse17)) (.cse9 (= |c_#valid| .cse11)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse2 (= (select |c_old(#valid)| .cse12) 0)) (.cse16 (= c_create_internal_~now~0.base .cse12))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse2 (= .cse3 1)) (or (= .cse4 1) .cse5 .cse6) (or (= .cse7 1) (= (select |c_old(#valid)| .cse8) 0) .cse9) (or (= .cse10 |c_create_internal_#t~ret7.base|) .cse5 .cse6) (= |c_#valid| (store .cse11 .cse8 .cse7)) (or .cse0 (= .cse12 .cse13) .cse2) (or .cse5 .cse6 (= .cse10 .cse13)) (or (= .cse10 c_create_internal_~now~0.base) .cse5 .cse6) (or (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse14 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|)) (.cse15 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|))) (and (= .cse14 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse15 (select |c_#valid| .cse15))) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse14 (select |v_#valid_BEFORE_CALL_276| .cse14))) (= .cse15 |c_create_internal_#t~ret7.base|)))) (and (or .cse0 .cse16) .cse6) (and .cse1 .cse6)) .cse9 (or .cse0 .cse2 .cse16)))))))))) is different from false [2024-11-14 02:45:27,255 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse12))) (let ((.cse17 (store |c_old(#valid)| .cse12 .cse3))) (let ((.cse10 (@diff .cse17 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse10))) (let ((.cse11 (store .cse17 .cse10 .cse4))) (let ((.cse8 (@diff .cse11 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse8)) (.cse13 (select (select |c_#memory_$Pointer$.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse5 (= (select |c_old(#valid)| .cse10) 0)) (.cse1 (= .cse12 |c_create_internal_#t~ret7.base|)) (.cse6 (= |c_#valid| .cse17)) (.cse9 (= |c_#valid| .cse11)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse2 (= (select |c_old(#valid)| .cse12) 0)) (.cse16 (= c_create_internal_~now~0.base .cse12))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse2 (= .cse3 1)) (or (= .cse4 1) .cse5 .cse6) (or (= .cse7 1) (= (select |c_old(#valid)| .cse8) 0) .cse9) (or (= .cse10 |c_create_internal_#t~ret7.base|) .cse5 .cse6) (= |c_#valid| (store .cse11 .cse8 .cse7)) (or .cse0 (= .cse12 .cse13) .cse2) (or .cse5 .cse6 (= .cse10 .cse13)) (or (= .cse10 c_create_internal_~now~0.base) .cse5 .cse6) (or (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse14 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|)) (.cse15 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|))) (and (= .cse14 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse15 (select |c_#valid| .cse15))) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse14 (select |v_#valid_BEFORE_CALL_276| .cse14))) (= .cse15 |c_create_internal_#t~ret7.base|)))) (and (or .cse0 .cse16) .cse6) (and .cse1 .cse6)) .cse9 (or .cse0 .cse2 .cse16)))))))))) is different from true [2024-11-14 02:45:27,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse3))) (let ((.cse16 (store |c_old(#valid)| .cse3 .cse8))) (let ((.cse15 (@diff .cse16 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse15))) (let ((.cse14 (store .cse16 .cse15 .cse9))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse11 (select |c_#valid| .cse12)) (.cse2 (= |c_#valid| |c_old(#valid)|)) (.cse0 (= .cse3 .cse6)) (.cse7 (= (select |c_old(#valid)| .cse3) 0)) (.cse10 (= (select |c_old(#valid)| .cse15) 0)) (.cse1 (= |c_#valid| .cse16)) (.cse13 (= |c_#valid| .cse14))) (and (or (and .cse0 .cse1) (and (or .cse2 (= c_create_internal_~now~0.base .cse3)) .cse1) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= .cse4 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse5 (select |c_#valid| .cse5))) (= .cse5 .cse6) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_276| .cse4))))))) (or .cse2 .cse7 (= .cse8 1)) (or (= .cse9 1) .cse10 .cse1) (or (= .cse11 1) (= (select |c_old(#valid)| .cse12) 0) .cse13) (= |c_#valid| (store .cse14 .cse12 .cse11)) (or .cse2 .cse0 .cse7) (or .cse10 .cse1 (= .cse15 .cse6)) .cse13 (= (select |c_#valid| c_create_internal_~now~0.base) 1)))))))))) is different from false [2024-11-14 02:45:27,271 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse3))) (let ((.cse16 (store |c_old(#valid)| .cse3 .cse8))) (let ((.cse15 (@diff .cse16 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse15))) (let ((.cse14 (store .cse16 .cse15 .cse9))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse11 (select |c_#valid| .cse12)) (.cse2 (= |c_#valid| |c_old(#valid)|)) (.cse0 (= .cse3 .cse6)) (.cse7 (= (select |c_old(#valid)| .cse3) 0)) (.cse10 (= (select |c_old(#valid)| .cse15) 0)) (.cse1 (= |c_#valid| .cse16)) (.cse13 (= |c_#valid| .cse14))) (and (or (and .cse0 .cse1) (and (or .cse2 (= c_create_internal_~now~0.base .cse3)) .cse1) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= .cse4 c_create_internal_~now~0.base) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse5 (select |c_#valid| .cse5))) (= .cse5 .cse6) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_276| .cse4))))))) (or .cse2 .cse7 (= .cse8 1)) (or (= .cse9 1) .cse10 .cse1) (or (= .cse11 1) (= (select |c_old(#valid)| .cse12) 0) .cse13) (= |c_#valid| (store .cse14 .cse12 .cse11)) (or .cse2 .cse0 .cse7) (or .cse10 .cse1 (= .cse15 .cse6)) .cse13 (= (select |c_#valid| c_create_internal_~now~0.base) 1)))))))))) is different from true [2024-11-14 02:45:27,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse17 (select |c_#valid| .cse15))) (let ((.cse16 (store |c_old(#valid)| .cse15 .cse17))) (let ((.cse14 (@diff .cse16 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse14))) (let ((.cse13 (store .cse16 .cse14 .cse8))) (let ((.cse11 (@diff .cse13 |c_#valid|))) (let ((.cse2 (= .cse17 1)) (.cse10 (select |c_#valid| .cse11)) (.cse9 (= (select |c_old(#valid)| .cse14) 0)) (.cse3 (= |c_#valid| .cse16)) (.cse12 (= |c_#valid| .cse13)) (.cse1 (= |c_#valid| |c_old(#valid)|)) (.cse7 (= (select |c_old(#valid)| .cse15) 0)) (.cse4 (= c_create_internal_~now~0.base .cse15))) (and (let ((.cse0 (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1)))) (or (and (or (and .cse0 .cse1) .cse2) .cse3) (and .cse0 .cse3 .cse4) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse5 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse5) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse6 (select |c_#valid| .cse6))) (= .cse6 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse5 (select |v_#valid_BEFORE_CALL_276| .cse5)))))))) (or .cse1 .cse7 .cse2) (or (= .cse8 1) .cse9 .cse3) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (= |c_#valid| (store .cse13 .cse11 .cse10)) (or (= .cse14 c_create_internal_~now~0.base) .cse9 .cse3) .cse12 (or .cse1 .cse7 .cse4)))))))))) is different from false [2024-11-14 02:45:27,287 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse17 (select |c_#valid| .cse15))) (let ((.cse16 (store |c_old(#valid)| .cse15 .cse17))) (let ((.cse14 (@diff .cse16 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse14))) (let ((.cse13 (store .cse16 .cse14 .cse8))) (let ((.cse11 (@diff .cse13 |c_#valid|))) (let ((.cse2 (= .cse17 1)) (.cse10 (select |c_#valid| .cse11)) (.cse9 (= (select |c_old(#valid)| .cse14) 0)) (.cse3 (= |c_#valid| .cse16)) (.cse12 (= |c_#valid| .cse13)) (.cse1 (= |c_#valid| |c_old(#valid)|)) (.cse7 (= (select |c_old(#valid)| .cse15) 0)) (.cse4 (= c_create_internal_~now~0.base .cse15))) (and (let ((.cse0 (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1)))) (or (and (or (and .cse0 .cse1) .cse2) .cse3) (and .cse0 .cse3 .cse4) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse5 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse5) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse6 (select |c_#valid| .cse6))) (= .cse6 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse5 (select |v_#valid_BEFORE_CALL_276| .cse5)))))))) (or .cse1 .cse7 .cse2) (or (= .cse8 1) .cse9 .cse3) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (= |c_#valid| (store .cse13 .cse11 .cse10)) (or (= .cse14 c_create_internal_~now~0.base) .cse9 .cse3) .cse12 (or .cse1 .cse7 .cse4)))))))))) is different from true [2024-11-14 02:45:27,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse9))) (let ((.cse8 (store |c_old(#valid)| .cse9 .cse2))) (let ((.cse3 (= |c_#valid| .cse8)) (.cse7 (@diff .cse8 |c_#valid|)) (.cse1 (= |c_#valid| |c_old(#valid)|)) (.cse4 (= c_create_internal_~now~0.base .cse9))) (and (let ((.cse0 (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1)))) (or (and (or (and .cse0 .cse1) (= .cse2 1)) .cse3) (and .cse0 .cse3 .cse4) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse5 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse5) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse6 (select |c_#valid| .cse6))) (= .cse6 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse5 (select |v_#valid_BEFORE_CALL_276| .cse5)))))))) (or (= .cse7 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse7) 0) .cse3) (= |c_#valid| (store .cse8 .cse7 (select |c_#valid| .cse7))) (or .cse1 (= (select |c_old(#valid)| .cse9) 0) .cse4)))))) is different from false [2024-11-14 02:45:27,299 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse9))) (let ((.cse8 (store |c_old(#valid)| .cse9 .cse2))) (let ((.cse3 (= |c_#valid| .cse8)) (.cse7 (@diff .cse8 |c_#valid|)) (.cse1 (= |c_#valid| |c_old(#valid)|)) (.cse4 (= c_create_internal_~now~0.base .cse9))) (and (let ((.cse0 (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1)))) (or (and (or (and .cse0 .cse1) (= .cse2 1)) .cse3) (and .cse0 .cse3 .cse4) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_276| |c_#valid|)) (.cse5 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse5) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_276| .cse6 (select |c_#valid| .cse6))) (= .cse6 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse5 (select |v_#valid_BEFORE_CALL_276| .cse5)))))))) (or (= .cse7 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse7) 0) .cse3) (= |c_#valid| (store .cse8 .cse7 (select |c_#valid| .cse7))) (or .cse1 (= (select |c_old(#valid)| .cse9) 0) .cse4)))))) is different from true [2024-11-14 02:45:27,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_68) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|))) (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= .cse8 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| .cse8 (select |v_#valid_BEFORE_CALL_278| .cse8)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse9 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |v_#valid_BEFORE_CALL_278| .cse9) 1) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse10 (select |v_#valid_BEFORE_CALL_278| .cse10))) (= .cse10 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse9 (select |v_#valid_BEFORE_CALL_276| .cse9)))))))))))))))))) is different from false [2024-11-14 02:45:27,411 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_68) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (let ((.cse8 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|))) (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= .cse8 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| .cse8 (select |v_#valid_BEFORE_CALL_278| .cse8)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (exists ((|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse9 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |v_#valid_BEFORE_CALL_278| .cse9) 1) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse10 (select |v_#valid_BEFORE_CALL_278| .cse10))) (= .cse10 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse9 (select |v_#valid_BEFORE_CALL_276| .cse9)))))))))))))))))) is different from true [2024-11-14 02:45:27,444 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse4))) (let ((.cse8 (store |c_old(#valid)| .cse4 .cse5))) (let ((.cse7 (@diff .cse8 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7))) (let ((.cse11 (store .cse8 .cse7 .cse6))) (let ((.cse10 (@diff .cse11 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse10))) (and (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (v_create_internal_~now~0.base_68 Int)) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_278| .cse0)))))) (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_68) 1)) .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|) 1)))) .cse1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_278| .cse3) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse2 (select |v_#valid_BEFORE_CALL_278| .cse2))) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_276| .cse3)))))))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse4) 0) (= .cse5 1)) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) (= |c_#valid| .cse8)) (or (= .cse9 1) (= (select |c_old(#valid)| .cse10) 0) (= |c_#valid| .cse11)) (= |c_#valid| (store .cse11 .cse10 .cse9))))))))))) is different from false [2024-11-14 02:45:27,455 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse4))) (let ((.cse8 (store |c_old(#valid)| .cse4 .cse5))) (let ((.cse7 (@diff .cse8 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7))) (let ((.cse11 (store .cse8 .cse7 .cse6))) (let ((.cse10 (@diff .cse11 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse10))) (and (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (v_create_internal_~now~0.base_68 Int)) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_278| .cse0)))))) (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_old(#valid)| v_create_internal_~now~0.base_68) 1)) .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |c_old(#valid)| (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_278|) 1)))) .cse1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse3 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_278| .cse3) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse2 (select |v_#valid_BEFORE_CALL_278| .cse2))) (= |v_#valid_BEFORE_CALL_276| (store |c_old(#valid)| .cse3 (select |v_#valid_BEFORE_CALL_276| .cse3)))))))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse4) 0) (= .cse5 1)) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) (= |c_#valid| .cse8)) (or (= .cse9 1) (= (select |c_old(#valid)| .cse10) 0) (= |c_#valid| .cse11)) (= |c_#valid| (store .cse11 .cse10 .cse9))))))))))) is different from true [2024-11-14 02:45:27,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1)) .cse0 .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_279| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_276| (store |v_#valid_BEFORE_CALL_279| .cse3 (select |v_#valid_BEFORE_CALL_276| .cse3))) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse2 (select |v_#valid_BEFORE_CALL_278| .cse2))) (= (select |v_#valid_BEFORE_CALL_278| .cse3) 1)))) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_279| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (v_create_internal_~now~0.base_68 Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_278|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_279| .cse4 (select |v_#valid_BEFORE_CALL_278| .cse4))) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1) (= (select |c_#valid| .cse4) 1)))) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_279| (Array Int Int)) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_279| (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_278|) 1)))) .cse1))) .cse0)) is different from false [2024-11-14 02:45:27,531 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (and (exists ((v_create_internal_~now~0.base_68 Int)) (= (select |c_#valid| v_create_internal_~now~0.base_68) 1)) .cse0 .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_279| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (|v_#valid_BEFORE_CALL_276| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_276| |v_#valid_BEFORE_CALL_278|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_276|))) (and (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_276| (store |v_#valid_BEFORE_CALL_279| .cse3 (select |v_#valid_BEFORE_CALL_276| .cse3))) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_276| .cse2 (select |v_#valid_BEFORE_CALL_278| .cse2))) (= (select |v_#valid_BEFORE_CALL_278| .cse3) 1)))) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_279| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_278| (Array Int Int)) (v_create_internal_~now~0.base_68 Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_278|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_279| .cse4 (select |v_#valid_BEFORE_CALL_278| .cse4))) (= (select |v_#valid_BEFORE_CALL_278| v_create_internal_~now~0.base_68) 1) (= (select |c_#valid| .cse4) 1)))) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_279| (Array Int Int)) (|v_#valid_BEFORE_CALL_278| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_278| alloc_and_zero_internal_~pi~1.base 1)) (= (select |v_#valid_BEFORE_CALL_279| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_278| (store |v_#valid_BEFORE_CALL_279| (@diff |v_#valid_BEFORE_CALL_279| |v_#valid_BEFORE_CALL_278|) 1)))) .cse1))) .cse0)) is different from true [2024-11-14 02:45:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:45:28,639 INFO L93 Difference]: Finished difference Result 200 states and 301 transitions. [2024-11-14 02:45:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 02:45:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 35 [2024-11-14 02:45:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:45:28,641 INFO L225 Difference]: With dead ends: 200 [2024-11-14 02:45:28,641 INFO L226 Difference]: Without dead ends: 200 [2024-11-14 02:45:28,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=379, Invalid=2001, Unknown=28, NotChecked=1498, Total=3906 [2024-11-14 02:45:28,642 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 90 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1646 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:45:28,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 485 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 881 Invalid, 0 Unknown, 1646 Unchecked, 1.3s Time] [2024-11-14 02:45:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-14 02:45:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 169. [2024-11-14 02:45:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 103 states have (on average 1.7378640776699028) internal successors, (179), 133 states have internal predecessors, (179), 23 states have call successors, (23), 5 states have call predecessors, (23), 7 states have return successors, (41), 30 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-14 02:45:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 243 transitions. [2024-11-14 02:45:28,658 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 243 transitions. Word has length 35 [2024-11-14 02:45:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:45:28,658 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 243 transitions. [2024-11-14 02:45:28,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-14 02:45:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 243 transitions. [2024-11-14 02:45:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 02:45:28,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:45:28,660 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:45:28,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 02:45:28,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 02:45:28,864 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:45:28,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:45:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash 594942247, now seen corresponding path program 2 times [2024-11-14 02:45:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:45:28,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617179692] [2024-11-14 02:45:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:45:28,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:45:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:45:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 02:45:30,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:45:30,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617179692] [2024-11-14 02:45:30,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617179692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:45:30,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917351185] [2024-11-14 02:45:30,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:45:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:45:30,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:45:30,355 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:45:30,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 02:45:30,612 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 02:45:30,612 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:45:30,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-14 02:45:30,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:45:30,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:45:30,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 02:45:31,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:45:31,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2024-11-14 02:45:31,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:45:31,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:45:31,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:45:31,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:45:31,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:45:31,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:45:31,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2024-11-14 02:45:31,523 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2024-11-14 02:45:31,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 37 [2024-11-14 02:45:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 02:45:31,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:45:32,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917351185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:45:32,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1812169905] [2024-11-14 02:45:32,091 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 02:45:32,092 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:45:32,092 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:45:32,092 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:45:32,092 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:45:32,571 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 55 for LOIs [2024-11-14 02:45:33,344 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 56 for LOIs [2024-11-14 02:45:33,362 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:45:33,374 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:45:40,606 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6607#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#t~ret10#1.offset| 0) (exists ((|v_ULTIMATE.start_create_~now~1#1.base_41| Int)) (and (<= (select |#length| |v_ULTIMATE.start_create_~now~1#1.base_41|) 15) (or (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (= |v_ULTIMATE.start_create_~now~1#1.base_41| |ULTIMATE.start_create_~sll~1#1.base|) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_345| (Array Int Int))) (= (select |v_#valid_345| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (exists ((v_create_internal_~now~0.offset_85 Int) (v_create_internal_~now~0.base_94 Int) (|v_#length_291| (Array Int Int)) (|v_#memory_$Pointer$.base_357| (Array Int (Array Int Int))) (|v_#valid_346| (Array Int Int)) (|v_#memory_$Pointer$.offset_354| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_357| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85) (store (select |v_#memory_$Pointer$.base_357| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85)) 0 0)) v_create_internal_~now~0.base_94 (store (select (store |v_#memory_$Pointer$.base_357| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85) (store (select |v_#memory_$Pointer$.base_357| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85)) 0 0)) v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85 (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85)))) (<= 0 v_create_internal_~now~0.offset_85) (<= (+ v_create_internal_~now~0.offset_85 8) (select |#length| v_create_internal_~now~0.base_94)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_354| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85) (store (select |v_#memory_$Pointer$.offset_354| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85)) 0 0)) v_create_internal_~now~0.base_94 (store (select (store |v_#memory_$Pointer$.offset_354| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85) (store (select |v_#memory_$Pointer$.offset_354| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85)) 0 0)) v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85 0))) (= (store |v_#valid_346| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85) 1) |#valid|) (<= (+ (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85) 1) |#StackHeapBarrier|) (= (store |v_#length_291| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85) 8) |#length|) (= 1 (select |#valid| v_create_internal_~now~0.base_94)) (= (select |v_#valid_346| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85)) 0) (not (= (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_94) v_create_internal_~now~0.offset_85) 0))))) (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_357| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_357| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.base_357| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_354| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_354| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.offset_354| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)))) (not (= |ULTIMATE.start_create_#t~ret10#1.base| 0)) (= |v_ULTIMATE.start_create_~now~1#1.base_41| |ULTIMATE.start_create_~sll~1#1.base|) (exists ((|v_#length_291| (Array Int Int))) (= |#length| (store |v_#length_291| |ULTIMATE.start_create_#t~ret10#1.base| 8))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_346| (Array Int Int))) (and (= (store |v_#valid_346| |ULTIMATE.start_create_#t~ret10#1.base| 1) |#valid|) (= (select |v_#valid_346| |ULTIMATE.start_create_#t~ret10#1.base|) 0))) (<= (+ |ULTIMATE.start_create_#t~ret10#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_345| (Array Int Int))) (= (select |v_#valid_345| |ULTIMATE.start_create_~sll~1#1.base|) 0)))))) (= |ULTIMATE.start_create_~sll~1#1.offset| 0))' at error location [2024-11-14 02:45:40,606 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:45:40,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:45:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 27 [2024-11-14 02:45:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628351441] [2024-11-14 02:45:40,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:45:40,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 02:45:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:45:40,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 02:45:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2301, Unknown=1, NotChecked=0, Total=2550 [2024-11-14 02:45:40,609 INFO L87 Difference]: Start difference. First operand 169 states and 243 transitions. Second operand has 28 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-14 02:45:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:45:42,280 INFO L93 Difference]: Finished difference Result 220 states and 327 transitions. [2024-11-14 02:45:42,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 02:45:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 35 [2024-11-14 02:45:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:45:42,283 INFO L225 Difference]: With dead ends: 220 [2024-11-14 02:45:42,283 INFO L226 Difference]: Without dead ends: 220 [2024-11-14 02:45:42,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=277, Invalid=2584, Unknown=1, NotChecked=0, Total=2862 [2024-11-14 02:45:42,284 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 136 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 78 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:45:42,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 366 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1336 Invalid, 6 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 02:45:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-14 02:45:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 173. [2024-11-14 02:45:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 107 states have (on average 1.766355140186916) internal successors, (189), 135 states have internal predecessors, (189), 23 states have call successors, (23), 5 states have call predecessors, (23), 7 states have return successors, (41), 32 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-14 02:45:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 253 transitions. [2024-11-14 02:45:42,294 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 253 transitions. Word has length 35 [2024-11-14 02:45:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:45:42,295 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 253 transitions. [2024-11-14 02:45:42,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-14 02:45:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 253 transitions. [2024-11-14 02:45:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:45:42,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:45:42,296 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:45:42,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 02:45:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 02:45:42,496 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:45:42,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:45:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1930990991, now seen corresponding path program 1 times [2024-11-14 02:45:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:45:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068212085] [2024-11-14 02:45:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:45:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:45:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:45:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:45:43,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:45:43,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068212085] [2024-11-14 02:45:43,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068212085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:45:43,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85071809] [2024-11-14 02:45:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:45:43,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:45:43,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:45:43,328 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:45:43,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 02:45:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:45:43,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 02:45:43,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:45:43,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:45:43,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 02:45:43,622 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_alloc_and_zero_internal_~pi~1.base_138 Int)) (and (= |c_#valid| (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_138 (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_138))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| v_alloc_and_zero_internal_~pi~1.base_138 (select |c_#memory_$Pointer$.base| v_alloc_and_zero_internal_~pi~1.base_138))) (= (select |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_138) 0))) is different from true [2024-11-14 02:45:43,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:45:43,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 02:45:43,707 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2024-11-14 02:45:43,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2024-11-14 02:45:43,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-14 02:45:43,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 02:45:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-14 02:45:43,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:45:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85071809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:45:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [558324775] [2024-11-14 02:45:44,251 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-14 02:45:44,251 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:45:44,251 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:45:44,251 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:45:44,251 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:45:44,879 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 107 for LOIs [2024-11-14 02:45:45,119 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 107 for LOIs [2024-11-14 02:45:45,157 INFO L197 IcfgInterpreter]: Interpreting procedure loop_internal with input of size 159 for LOIs [2024-11-14 02:45:45,233 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:45:45,244 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:46:54,316 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7206#(and (not (= (select |#valid| |loop_internal_#in~l.base|) 1)) (= |loop_internal_#in~l.offset| loop_internal_~l.offset) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_56| (Array Int Int)) (|v_#memory_$Pointer$.offset_386| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_43| Int) (|v_#memory_$Pointer$.base_396| (Array Int (Array Int Int))) (|v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1| Int)) (and (or (and (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) 1) |#StackHeapBarrier|) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_56| 0) 0) (<= (+ |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_384| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_384| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) (store (select |v_#memory_$Pointer$.offset_384| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16)) 0 0)) |v_#memory_$Pointer$.offset_386|)) (exists ((|v_#valid_366| (Array Int Int))) (= (select |v_#valid_366| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1|) 0)) (exists ((|v_#memory_$Pointer$.base_392| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_392| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) (store (select |v_#memory_$Pointer$.base_392| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16)) 0 0)) |v_#memory_$Pointer$.base_396|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) 0)) (= |v_ULTIMATE.start_create_~now~1#1.base_43| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1|) (exists ((|v_#length_306| (Array Int Int))) (= |#length| (store |v_#length_306| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) 8))) (exists ((|v_#memory_$Pointer$.base_394| (Array Int (Array Int Int))) (|v_#length_307| (Array Int Int)) (|v_#valid_368| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_208| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_208| (store (store |v_#memory_$Pointer$.base_394| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_208| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8) (store (select |v_#memory_$Pointer$.base_394| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_208| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8)) 0 0)) |v_ULTIMATE.start_create_~now~1#1.base_43| (store (select (store |v_#memory_$Pointer$.base_394| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_208| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8) (store (select |v_#memory_$Pointer$.base_394| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_208| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8)) 0 0)) |v_ULTIMATE.start_create_~now~1#1.base_43|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_208| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8)))) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_208| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8) 0)) (= (select |v_#valid_368| |v_ULTIMATE.start_create_~now~1#1.base_43|) 1) (= (select |v_#valid_368| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_208| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8)) 0) (<= 16 (select |v_#length_307| |v_ULTIMATE.start_create_~now~1#1.base_43|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_208| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8) 1) |#StackHeapBarrier|))) (exists ((|v_#valid_367| (Array Int Int))) (and (= (store |v_#valid_367| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) 1) |#valid|) (= (select |v_#valid_367| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16)) 0)))) (and (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) 1) |#StackHeapBarrier|) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_56| 0) 0) (<= (+ |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (exists ((|v_#length_308| (Array Int Int))) (= (store |v_#length_308| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) 8) |#length|)) (exists ((|v_#valid_366| (Array Int Int))) (= (select |v_#valid_366| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1|) 0)) (exists ((|v_#memory_$Pointer$.offset_385| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_385| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) (store (select |v_#memory_$Pointer$.offset_385| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16)) 0 0)) |v_#memory_$Pointer$.offset_386|)) (exists ((|v_#memory_$Pointer$.base_392| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_392| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) (store (select |v_#memory_$Pointer$.base_392| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16)) 0 0)) |v_#memory_$Pointer$.base_396|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) 0)) (exists ((|v_#valid_369| (Array Int Int))) (and (= (select |v_#valid_369| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16)) 0) (= |#valid| (store |v_#valid_369| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16) 1)))) (= |v_ULTIMATE.start_create_~now~1#1.base_43| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1|) (exists ((|v_#valid_367| (Array Int Int)) (|v_#length_306| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_209| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_395| (Array Int (Array Int Int)))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_209| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8) 0)) (<= 16 (select |v_#length_306| |v_ULTIMATE.start_create_~now~1#1.base_43|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_209| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8) 1) |#StackHeapBarrier|) (= (select |v_#valid_367| |v_ULTIMATE.start_create_~now~1#1.base_43|) 1) (= (select |v_#valid_367| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_209| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8)) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_209| (store (store |v_#memory_$Pointer$.base_395| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_209| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8) (store (select |v_#memory_$Pointer$.base_395| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_209| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8)) 0 0)) |v_ULTIMATE.start_create_~now~1#1.base_43| (store (select (store |v_#memory_$Pointer$.base_395| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_209| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8) (store (select |v_#memory_$Pointer$.base_395| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_209| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8)) 0 0)) |v_ULTIMATE.start_create_~now~1#1.base_43|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_209| |v_ULTIMATE.start_create_~now~1#1.base_43|) 8)))))))) (= (store |v_#memory_$Pointer$.base_396| |v_ULTIMATE.start_create_~now~1#1.base_43| (store (select |v_#memory_$Pointer$.base_396| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16))) |#memory_$Pointer$.base|) (<= 24 (select |#length| |v_ULTIMATE.start_create_~now~1#1.base_43|)) (= |loop_internal_#in~l.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1|) 8)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_386| |v_ULTIMATE.start_create_~now~1#1.base_43| (store (select |v_#memory_$Pointer$.offset_386| |v_ULTIMATE.start_create_~now~1#1.base_43|) 16 0))) (not (= |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1| 0)) (= |loop_internal_#in~l.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_1|) 8)) (= (select |#valid| |v_ULTIMATE.start_create_~now~1#1.base_43|) 1))) (or (not (= loop_internal_~l.offset 0)) (not (= |loop_internal_#in~l.base| 0))))' at error location [2024-11-14 02:46:54,316 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:46:54,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:46:54,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 27 [2024-11-14 02:46:54,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055441603] [2024-11-14 02:46:54,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:46:54,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 02:46:54,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:46:54,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 02:46:54,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3094, Unknown=25, NotChecked=112, Total=3422 [2024-11-14 02:46:54,318 INFO L87 Difference]: Start difference. First operand 173 states and 253 transitions. Second operand has 28 states, 20 states have (on average 2.25) internal successors, (45), 21 states have internal predecessors, (45), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-14 02:47:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:47:02,570 INFO L93 Difference]: Finished difference Result 216 states and 310 transitions. [2024-11-14 02:47:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 02:47:02,571 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 2.25) internal successors, (45), 21 states have internal predecessors, (45), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 39 [2024-11-14 02:47:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:47:02,572 INFO L225 Difference]: With dead ends: 216 [2024-11-14 02:47:02,572 INFO L226 Difference]: Without dead ends: 216 [2024-11-14 02:47:02,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 72.3s TimeCoverageRelationStatistics Valid=257, Invalid=4552, Unknown=25, NotChecked=136, Total=4970 [2024-11-14 02:47:02,574 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 98 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-14 02:47:02,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 787 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1716 Invalid, 0 Unknown, 188 Unchecked, 5.7s Time] [2024-11-14 02:47:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-14 02:47:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 191. [2024-11-14 02:47:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 150 states have internal predecessors, (212), 24 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (51), 34 states have call predecessors, (51), 24 states have call successors, (51) [2024-11-14 02:47:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 287 transitions. [2024-11-14 02:47:02,588 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 287 transitions. Word has length 39 [2024-11-14 02:47:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:47:02,588 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 287 transitions. [2024-11-14 02:47:02,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 2.25) internal successors, (45), 21 states have internal predecessors, (45), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-14 02:47:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 287 transitions. [2024-11-14 02:47:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:47:02,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:47:02,590 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:47:02,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-14 02:47:02,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:47:02,791 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:47:02,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:47:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1930990992, now seen corresponding path program 1 times [2024-11-14 02:47:02,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:47:02,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888724611] [2024-11-14 02:47:02,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:47:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:47:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:47:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:47:06,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:47:06,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888724611] [2024-11-14 02:47:06,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888724611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:47:06,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980942367] [2024-11-14 02:47:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:47:06,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:47:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:47:06,075 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:47:06,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 02:47:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:47:06,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-14 02:47:06,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:47:06,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:47:06,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 02:47:06,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 02:47:07,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 02:47:07,368 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_alloc_and_zero_internal_~pi~1.base_151 Int)) (and (= (store |c_old(#memory_$Pointer$.offset)| v_alloc_and_zero_internal_~pi~1.base_151 (select |c_#memory_$Pointer$.offset| v_alloc_and_zero_internal_~pi~1.base_151)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_151) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| v_alloc_and_zero_internal_~pi~1.base_151 (select |c_#memory_$Pointer$.base| v_alloc_and_zero_internal_~pi~1.base_151))) (= (store |c_old(#length)| v_alloc_and_zero_internal_~pi~1.base_151 (select |c_#length| v_alloc_and_zero_internal_~pi~1.base_151)) |c_#length|))) is different from true [2024-11-14 02:47:07,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:47:07,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-14 02:47:07,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:47:07,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 02:47:07,709 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2024-11-14 02:47:07,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2024-11-14 02:47:07,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 02:47:07,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 02:47:08,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-14 02:47:08,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 02:47:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-14 02:47:08,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:47:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980942367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:47:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [268980688] [2024-11-14 02:47:10,754 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-14 02:47:10,754 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:47:10,754 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:47:10,754 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:47:10,755 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:47:11,220 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 107 for LOIs [2024-11-14 02:47:11,432 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 105 for LOIs [2024-11-14 02:47:11,462 INFO L197 IcfgInterpreter]: Interpreting procedure loop_internal with input of size 159 for LOIs [2024-11-14 02:47:11,578 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:47:11,600 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:48:34,019 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7848#(and (<= 1 |#StackHeapBarrier|) (or (not (= |loop_internal_#in~l.base| 0)) (not (= |loop_internal_#in~l.offset| 0))) (exists ((|v_#memory_$Pointer$.offset_413| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_66| (Array Int Int)) (|v_#memory_$Pointer$.base_423| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_45| Int) (|v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2|) 8) |loop_internal_#in~l.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_413| |v_ULTIMATE.start_create_~now~1#1.base_45| (store (select |v_#memory_$Pointer$.offset_413| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16 0))) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_224| (Array Int (Array Int Int))) (|v_#length_327| (Array Int Int)) (|v_#valid_387| (Array Int Int)) (|v_#memory_$Pointer$.base_422| (Array Int (Array Int Int)))) (and (= (select |v_#valid_387| |v_ULTIMATE.start_create_~now~1#1.base_45|) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_224| (store (store |v_#memory_$Pointer$.base_422| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_224| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8) (store (select |v_#memory_$Pointer$.base_422| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_224| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8)) 0 0)) |v_ULTIMATE.start_create_~now~1#1.base_45| (store (select (store |v_#memory_$Pointer$.base_422| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_224| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8) (store (select |v_#memory_$Pointer$.base_422| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_224| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8)) 0 0)) |v_ULTIMATE.start_create_~now~1#1.base_45|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_224| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8)))) (<= 16 (select |v_#length_327| |v_ULTIMATE.start_create_~now~1#1.base_45|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_224| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8) 1) |#StackHeapBarrier|) (= (select |v_#valid_387| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_224| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_224| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8) 0)))) (<= (+ |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) 1) |#StackHeapBarrier|) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_66| 0) 0) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) 0)) (exists ((|v_#length_325| (Array Int Int))) (= |#length| (store |v_#length_325| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) 8))) (exists ((|v_#memory_$Pointer$.base_419| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_419| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) (store (select |v_#memory_$Pointer$.base_419| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16)) 0 0)) |v_#memory_$Pointer$.base_423|)) (exists ((|v_#valid_384| (Array Int Int))) (= (select |v_#valid_384| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2|) 0)) (= |v_ULTIMATE.start_create_~now~1#1.base_45| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2|) (exists ((|v_#memory_$Pointer$.offset_409| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_413| (store |v_#memory_$Pointer$.offset_409| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) (store (select |v_#memory_$Pointer$.offset_409| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16)) 0 0)))) (exists ((|v_#valid_385| (Array Int Int))) (and (= (store |v_#valid_385| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) 1) |#valid|) (= (select |v_#valid_385| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16)) 0)))) (and (exists ((|v_#valid_386| (Array Int Int))) (and (= (store |v_#valid_386| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) 1) |#valid|) (= (select |v_#valid_386| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16)) 0))) (<= (+ |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_411| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_411| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) (store (select |v_#memory_$Pointer$.offset_411| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16)) 0 0)) |v_#memory_$Pointer$.offset_413|)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_66| 0) 0) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) 0)) (exists ((|v_#memory_$Pointer$.base_419| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_419| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) (store (select |v_#memory_$Pointer$.base_419| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16)) 0 0)) |v_#memory_$Pointer$.base_423|)) (exists ((|v_#valid_384| (Array Int Int))) (= (select |v_#valid_384| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2|) 0)) (= |v_ULTIMATE.start_create_~now~1#1.base_45| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2|) (exists ((|v_#valid_385| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_223| (Array Int (Array Int Int))) (|v_#length_325| (Array Int Int)) (|v_#memory_$Pointer$.base_421| (Array Int (Array Int Int)))) (and (= 0 (select |v_#valid_385| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_223| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_223| (store (store |v_#memory_$Pointer$.base_421| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_223| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8) (store (select |v_#memory_$Pointer$.base_421| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_223| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8)) 0 0)) |v_ULTIMATE.start_create_~now~1#1.base_45| (store (select (store |v_#memory_$Pointer$.base_421| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_223| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8) (store (select |v_#memory_$Pointer$.base_421| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_223| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8)) 0 0)) |v_ULTIMATE.start_create_~now~1#1.base_45|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_223| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8)))) (<= 16 (select |v_#length_325| |v_ULTIMATE.start_create_~now~1#1.base_45|)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_223| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8) 0)) (= (select |v_#valid_385| |v_ULTIMATE.start_create_~now~1#1.base_45|) 1) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_223| |v_ULTIMATE.start_create_~now~1#1.base_45|) 8) 1) |#StackHeapBarrier|))) (exists ((|v_#length_326| (Array Int Int))) (= (store |v_#length_326| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16) 8) |#length|)))) (= (store |v_#memory_$Pointer$.base_423| |v_ULTIMATE.start_create_~now~1#1.base_45| (store (select |v_#memory_$Pointer$.base_423| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_~now~1#1.base_45|) 16))) |#memory_$Pointer$.base|) (= |loop_internal_#in~l.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2|) 8)) (= (select |#valid| |v_ULTIMATE.start_create_~now~1#1.base_45|) 1) (<= 24 (select |#length| |v_ULTIMATE.start_create_~now~1#1.base_45|)) (not (= |v_ULTIMATE.start_loop_~l#1.base_BEFORE_CALL_2| 0)))) (or (< |loop_internal_#in~l.offset| 0) (< (select |#length| |loop_internal_#in~l.base|) (+ |loop_internal_#in~l.offset| 8))))' at error location [2024-11-14 02:48:34,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:48:34,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:48:34,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 29 [2024-11-14 02:48:34,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447372255] [2024-11-14 02:48:34,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:48:34,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 02:48:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:48:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 02:48:34,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3666, Unknown=26, NotChecked=122, Total=4032 [2024-11-14 02:48:34,022 INFO L87 Difference]: Start difference. First operand 191 states and 287 transitions. Second operand has 30 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-14 02:48:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:48:45,386 INFO L93 Difference]: Finished difference Result 229 states and 332 transitions. [2024-11-14 02:48:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 02:48:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 39 [2024-11-14 02:48:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:48:45,389 INFO L225 Difference]: With dead ends: 229 [2024-11-14 02:48:45,389 INFO L226 Difference]: Without dead ends: 229 [2024-11-14 02:48:45,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 91.9s TimeCoverageRelationStatistics Valid=276, Invalid=4957, Unknown=27, NotChecked=142, Total=5402 [2024-11-14 02:48:45,391 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 113 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-14 02:48:45,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 763 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1798 Invalid, 0 Unknown, 190 Unchecked, 6.5s Time] [2024-11-14 02:48:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-14 02:48:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 206. [2024-11-14 02:48:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 134 states have (on average 1.708955223880597) internal successors, (229), 162 states have internal predecessors, (229), 26 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (56), 36 states have call predecessors, (56), 26 states have call successors, (56) [2024-11-14 02:48:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions. [2024-11-14 02:48:45,403 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 39 [2024-11-14 02:48:45,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:48:45,403 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 311 transitions. [2024-11-14 02:48:45,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-14 02:48:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions. [2024-11-14 02:48:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 02:48:45,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:48:45,405 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:48:45,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-14 02:48:45,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:48:45,605 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:48:45,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:48:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash 256676391, now seen corresponding path program 1 times [2024-11-14 02:48:45,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:48:45,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138519967] [2024-11-14 02:48:45,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:48:45,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:48:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:48:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:48:49,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:48:49,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138519967] [2024-11-14 02:48:49,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138519967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:48:49,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380287754] [2024-11-14 02:48:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:48:49,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:48:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:48:49,430 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:48:49,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 02:48:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:48:49,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-14 02:48:49,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:48:49,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:48:50,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:48:50,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:48:51,774 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 02:48:51,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 02:48:52,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-14 02:48:52,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-14 02:48:52,600 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_alloc_and_zero_internal_~pi~1.base_164 Int)) (and (= (store |c_old(#memory_$Pointer$.base)| v_alloc_and_zero_internal_~pi~1.base_164 (select |c_#memory_$Pointer$.base| v_alloc_and_zero_internal_~pi~1.base_164)) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| v_alloc_and_zero_internal_~pi~1.base_164 (select |c_#memory_$Pointer$.offset| v_alloc_and_zero_internal_~pi~1.base_164))) (= (select |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_164) 0))) is different from true [2024-11-14 02:48:52,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:48:52,793 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 02:48:52,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 51 [2024-11-14 02:48:52,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:48:52,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:48:52,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-14 02:48:52,941 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-14 02:48:52,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-14 02:48:53,298 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-14 02:48:53,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 34 [2024-11-14 02:48:53,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-14 02:48:55,103 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:48:55,133 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-11-14 02:48:55,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-11-14 02:48:55,182 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 02:48:55,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-11-14 02:48:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-14 02:48:55,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:49:00,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380287754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:49:00,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [580537028] [2024-11-14 02:49:00,907 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-14 02:49:00,907 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:49:00,907 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:49:00,908 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:49:00,908 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:49:01,341 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 109 for LOIs [2024-11-14 02:49:01,554 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 105 for LOIs [2024-11-14 02:49:01,589 INFO L197 IcfgInterpreter]: Interpreting procedure loop_internal with input of size 158 for LOIs [2024-11-14 02:49:01,717 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2024-11-14 02:49:01,741 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:51:05,761 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8539#(and (<= 1 |#StackHeapBarrier|) (exists ((v_loop_internal_~l.base_25 Int)) (and (not (= (select |#valid| v_loop_internal_~l.base_25) 1)) (or (not (= loop_internal_~l.offset 0)) (not (= v_loop_internal_~l.base_25 0))))))' at error location [2024-11-14 02:51:05,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:51:05,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:51:05,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 43 [2024-11-14 02:51:05,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557472018] [2024-11-14 02:51:05,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:51:05,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 02:51:05,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:51:05,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 02:51:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=5393, Unknown=43, NotChecked=148, Total=5852 [2024-11-14 02:51:05,765 INFO L87 Difference]: Start difference. First operand 206 states and 311 transitions. Second operand has 43 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-14 02:51:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:51:19,937 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2024-11-14 02:51:19,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 02:51:19,938 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 41 [2024-11-14 02:51:19,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:51:19,939 INFO L225 Difference]: With dead ends: 222 [2024-11-14 02:51:19,940 INFO L226 Difference]: Without dead ends: 222 [2024-11-14 02:51:19,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 140.0s TimeCoverageRelationStatistics Valid=361, Invalid=7432, Unknown=43, NotChecked=174, Total=8010 [2024-11-14 02:51:19,943 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-14 02:51:19,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1321 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2365 Invalid, 0 Unknown, 159 Unchecked, 9.0s Time] [2024-11-14 02:51:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-14 02:51:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2024-11-14 02:51:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 133 states have (on average 1.6917293233082706) internal successors, (225), 161 states have internal predecessors, (225), 26 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (56), 36 states have call predecessors, (56), 26 states have call successors, (56) [2024-11-14 02:51:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 307 transitions. [2024-11-14 02:51:19,954 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 307 transitions. Word has length 41 [2024-11-14 02:51:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:51:19,954 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 307 transitions. [2024-11-14 02:51:19,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-14 02:51:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 307 transitions. [2024-11-14 02:51:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-14 02:51:19,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:51:19,956 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:51:19,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 02:51:20,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:51:20,157 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-14 02:51:20,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:51:20,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1772665581, now seen corresponding path program 2 times [2024-11-14 02:51:20,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:51:20,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860755685] [2024-11-14 02:51:20,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:51:20,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:51:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:51:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 02:51:22,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:51:22,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860755685] [2024-11-14 02:51:22,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860755685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:51:22,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28140302] [2024-11-14 02:51:22,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:51:22,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:51:22,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:51:22,549 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:51:22,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a550699-bda2-4f04-bfbd-318f58298fe9/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 02:51:22,792 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 02:51:22,792 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:51:22,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 02:51:22,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:51:23,274 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_create_internal_~now~0.base) 0) (or (exists ((|v_#valid_BEFORE_CALL_485| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_create_internal_#t~ret7.base|) (= (store |c_old(#valid)| c_create_internal_~now~0.base (select |v_#valid_BEFORE_CALL_485| c_create_internal_~now~0.base)) |v_#valid_BEFORE_CALL_485|)))) (= |c_#valid| (store |c_old(#valid)| c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base))))) is different from false [2024-11-14 02:51:23,281 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_create_internal_~now~0.base) 0) (or (exists ((|v_#valid_BEFORE_CALL_485| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_create_internal_#t~ret7.base|) (= (store |c_old(#valid)| c_create_internal_~now~0.base (select |v_#valid_BEFORE_CALL_485| c_create_internal_~now~0.base)) |v_#valid_BEFORE_CALL_485|)))) (= |c_#valid| (store |c_old(#valid)| c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base))))) is different from true [2024-11-14 02:51:23,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:51:23,344 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_create_internal_~now~0.base) 0) (or (exists ((|v_#valid_BEFORE_CALL_485| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |c_#valid| .cse0))) (= (store |c_old(#valid)| c_create_internal_~now~0.base (select |v_#valid_BEFORE_CALL_485| c_create_internal_~now~0.base)) |v_#valid_BEFORE_CALL_485|) (= .cse0 (select (select |c_#memory_$Pointer$.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))))) (= |c_#valid| (store |c_old(#valid)| c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base))))) is different from false [2024-11-14 02:51:23,350 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_create_internal_~now~0.base) 0) (or (exists ((|v_#valid_BEFORE_CALL_485| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |c_#valid| .cse0))) (= (store |c_old(#valid)| c_create_internal_~now~0.base (select |v_#valid_BEFORE_CALL_485| c_create_internal_~now~0.base)) |v_#valid_BEFORE_CALL_485|) (= .cse0 (select (select |c_#memory_$Pointer$.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))))) (= |c_#valid| (store |c_old(#valid)| c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base))))) is different from true [2024-11-14 02:51:23,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2024-11-14 02:51:23,451 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |c_#valid| v_create_internal_~now~0.base_108))))) (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (exists ((|v_#valid_BEFORE_CALL_485| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |c_#valid|))) (and (= |v_#valid_BEFORE_CALL_485| (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |v_#valid_BEFORE_CALL_485| v_create_internal_~now~0.base_108))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |c_#valid| .cse0))) (= .cse0 c_create_internal_~now~0.base))))))) is different from false [2024-11-14 02:51:23,458 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |c_#valid| v_create_internal_~now~0.base_108))))) (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (exists ((|v_#valid_BEFORE_CALL_485| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |c_#valid|))) (and (= |v_#valid_BEFORE_CALL_485| (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |v_#valid_BEFORE_CALL_485| v_create_internal_~now~0.base_108))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |c_#valid| .cse0))) (= .cse0 c_create_internal_~now~0.base))))))) is different from true [2024-11-14 02:51:23,586 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-14 02:51:23,689 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_487| (Array Int Int))) (and (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (exists ((|v_#valid_BEFORE_CALL_485| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |v_#valid_BEFORE_CALL_487|))) (and (= |v_#valid_BEFORE_CALL_485| (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |v_#valid_BEFORE_CALL_485| v_create_internal_~now~0.base_108))) (= .cse0 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_487| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |v_#valid_BEFORE_CALL_487| .cse0)))))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_487| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store |c_old(#valid)| v_create_internal_~now~0.base_108 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |c_#valid| v_create_internal_~now~0.base_108)) alloc_and_zero_internal_~pi~1.base 1)) (not (= v_create_internal_~now~0.base_108 alloc_and_zero_internal_~pi~1.base))))) is different from false [2024-11-14 02:51:23,696 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_487| (Array Int Int))) (and (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (exists ((|v_#valid_BEFORE_CALL_485| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |v_#valid_BEFORE_CALL_487|))) (and (= |v_#valid_BEFORE_CALL_485| (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |v_#valid_BEFORE_CALL_485| v_create_internal_~now~0.base_108))) (= .cse0 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_487| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |v_#valid_BEFORE_CALL_487| .cse0)))))))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_487| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store |c_old(#valid)| v_create_internal_~now~0.base_108 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |c_#valid| v_create_internal_~now~0.base_108)) alloc_and_zero_internal_~pi~1.base 1)) (not (= v_create_internal_~now~0.base_108 alloc_and_zero_internal_~pi~1.base))))) is different from true [2024-11-14 02:51:23,807 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_487| (Array Int Int)) (|v_#valid_BEFORE_CALL_485| (Array Int Int)) (v_create_internal_~now~0.base_108 Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |v_#valid_BEFORE_CALL_487|))) (and (= |v_#valid_BEFORE_CALL_485| (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |v_#valid_BEFORE_CALL_485| v_create_internal_~now~0.base_108))) (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_487| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_487| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |v_#valid_BEFORE_CALL_487| .cse0)))))) (and .cse1 (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store |c_old(#valid)| v_create_internal_~now~0.base_108 1))))) (and .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |c_#valid| v_create_internal_~now~0.base_108)) alloc_and_zero_internal_~pi~1.base 1)) (not (= v_create_internal_~now~0.base_108 alloc_and_zero_internal_~pi~1.base))))))) is different from false [2024-11-14 02:51:23,814 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)))) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_487| (Array Int Int)) (|v_#valid_BEFORE_CALL_485| (Array Int Int)) (v_create_internal_~now~0.base_108 Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_485| |v_#valid_BEFORE_CALL_487|))) (and (= |v_#valid_BEFORE_CALL_485| (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |v_#valid_BEFORE_CALL_485| v_create_internal_~now~0.base_108))) (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_487| alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_487| (store |v_#valid_BEFORE_CALL_485| .cse0 (select |v_#valid_BEFORE_CALL_487| .cse0)))))) (and .cse1 (exists ((v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store |c_old(#valid)| v_create_internal_~now~0.base_108 1))))) (and .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_create_internal_~now~0.base_108 Int)) (and (= (select |c_old(#valid)| v_create_internal_~now~0.base_108) 0) (= |c_#valid| (store (store |c_old(#valid)| v_create_internal_~now~0.base_108 (select |c_#valid| v_create_internal_~now~0.base_108)) alloc_and_zero_internal_~pi~1.base 1)) (not (= v_create_internal_~now~0.base_108 alloc_and_zero_internal_~pi~1.base))))))) is different from true [2024-11-14 02:51:24,889 INFO L349 Elim1Store]: treesize reduction 217, result has 27.9 percent of original size [2024-11-14 02:51:24,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 89 treesize of output 214 [2024-11-14 02:51:27,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:27,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:27,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:27,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:27,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:28,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:29,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:51:42,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 02:51:42,086 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 02:51:42,145 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,237 INFO L349 Elim1Store]: treesize reduction 36, result has 21.7 percent of original size [2024-11-14 02:51:42,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 16 [2024-11-14 02:51:42,311 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,375 INFO L349 Elim1Store]: treesize reduction 26, result has 23.5 percent of original size [2024-11-14 02:51:42,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 22 [2024-11-14 02:51:42,440 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,495 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-14 02:51:42,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 17 [2024-11-14 02:51:42,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 02:51:42,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,601 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-14 02:51:42,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 11 [2024-11-14 02:51:42,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2024-11-14 02:51:42,679 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 02:51:42,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-14 02:51:42,789 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 02:51:42,850 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2024-11-14 02:51:42,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:42,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 02:51:46,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2024-11-14 02:51:47,198 INFO L349 Elim1Store]: treesize reduction 139, result has 33.5 percent of original size [2024-11-14 02:51:47,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 181 [2024-11-14 02:51:50,000 INFO L349 Elim1Store]: treesize reduction 135, result has 16.1 percent of original size [2024-11-14 02:51:50,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 50 [2024-11-14 02:51:50,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:50,211 INFO L349 Elim1Store]: treesize reduction 72, result has 6.5 percent of original size [2024-11-14 02:51:50,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 22 [2024-11-14 02:51:50,300 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:50,589 INFO L349 Elim1Store]: treesize reduction 148, result has 10.8 percent of original size [2024-11-14 02:51:50,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 42 [2024-11-14 02:51:50,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:50,702 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:50,775 INFO L349 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2024-11-14 02:51:50,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 20 [2024-11-14 02:51:51,035 INFO L349 Elim1Store]: treesize reduction 61, result has 18.7 percent of original size [2024-11-14 02:51:51,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 33 [2024-11-14 02:51:51,118 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:51,262 INFO L349 Elim1Store]: treesize reduction 65, result has 17.7 percent of original size [2024-11-14 02:51:51,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 33 [2024-11-14 02:51:51,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:51,619 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:51:51,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-14 02:51:51,710 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:51,790 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2024-11-14 02:51:51,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 20 [2024-11-14 02:51:51,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2024-11-14 02:51:51,950 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:51:52,026 INFO L349 Elim1Store]: treesize reduction 22, result has 31.3 percent of original size [2024-11-14 02:51:52,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 21 [2024-11-14 02:51:52,182 INFO L349 Elim1Store]: treesize reduction 36, result has 21.7 percent of original size [2024-11-14 02:51:52,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 21 [2024-11-14 02:51:52,705 INFO L349 Elim1Store]: treesize reduction 139, result has 33.5 percent of original size [2024-11-14 02:51:52,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 155 [2024-11-14 02:51:56,161 INFO L349 Elim1Store]: treesize reduction 95, result has 16.7 percent of original size [2024-11-14 02:51:56,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 38 [2024-11-14 02:51:56,558 INFO L349 Elim1Store]: treesize reduction 135, result has 16.1 percent of original size [2024-11-14 02:51:56,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 50 [2024-11-14 02:51:56,755 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2024-11-14 02:51:56,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 27 [2024-11-14 02:51:57,173 INFO L349 Elim1Store]: treesize reduction 178, result has 11.4 percent of original size [2024-11-14 02:51:57,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 40 treesize of output 47 [2024-11-14 02:51:57,407 INFO L349 Elim1Store]: treesize reduction 76, result has 12.6 percent of original size [2024-11-14 02:51:57,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 32 [2024-11-14 02:51:57,755 INFO L349 Elim1Store]: treesize reduction 72, result has 6.5 percent of original size [2024-11-14 02:51:57,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 27 [2024-11-14 02:51:57,992 INFO L349 Elim1Store]: treesize reduction 61, result has 18.7 percent of original size [2024-11-14 02:51:57,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 33 [2024-11-14 02:51:58,112 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:51:58,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 02:51:58,817 INFO L349 Elim1Store]: treesize reduction 139, result has 33.5 percent of original size [2024-11-14 02:51:58,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 139 treesize of output 221 [2024-11-14 02:52:01,684 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:01,779 INFO L349 Elim1Store]: treesize reduction 72, result has 6.5 percent of original size [2024-11-14 02:52:01,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 22 [2024-11-14 02:52:01,868 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:01,912 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:52:01,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-14 02:52:02,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:02,144 INFO L349 Elim1Store]: treesize reduction 65, result has 17.7 percent of original size [2024-11-14 02:52:02,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 33 [2024-11-14 02:52:02,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:02,521 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:02,590 INFO L349 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2024-11-14 02:52:02,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 20 [2024-11-14 02:52:02,937 INFO L349 Elim1Store]: treesize reduction 61, result has 18.7 percent of original size [2024-11-14 02:52:02,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 33 [2024-11-14 02:52:03,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:03,263 INFO L349 Elim1Store]: treesize reduction 148, result has 10.8 percent of original size [2024-11-14 02:52:03,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 42 [2024-11-14 02:52:03,389 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:03,471 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2024-11-14 02:52:03,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 20 [2024-11-14 02:52:03,867 INFO L349 Elim1Store]: treesize reduction 135, result has 16.1 percent of original size [2024-11-14 02:52:03,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 50 [2024-11-14 02:52:04,491 INFO L349 Elim1Store]: treesize reduction 139, result has 33.5 percent of original size [2024-11-14 02:52:04,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 133 [2024-11-14 02:52:06,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:06,439 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:06,481 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:52:06,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2024-11-14 02:52:06,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:06,846 INFO L349 Elim1Store]: treesize reduction 302, result has 0.3 percent of original size [2024-11-14 02:52:06,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 54 treesize of output 1 [2024-11-14 02:52:06,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:06,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:06,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:06,983 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:06,987 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-14 02:52:06,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 17 [2024-11-14 02:52:07,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:07,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:07,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:52:07,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:52:07,042 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2024-11-14 02:52:07,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 1 [2024-11-14 02:52:07,966 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:52:07,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2024-11-14 02:52:10,404 INFO L349 Elim1Store]: treesize reduction 440, result has 31.4 percent of original size [2024-11-14 02:52:10,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 103 treesize of output 367 [2024-11-14 02:53:34,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:34,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:34,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,254 INFO L224 Elim1Store]: Index analysis took 215 ms [2024-11-14 02:53:34,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:34,284 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,285 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,286 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,371 INFO L349 Elim1Store]: treesize reduction 197, result has 0.5 percent of original size [2024-11-14 02:53:34,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 45 [2024-11-14 02:53:34,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,609 INFO L224 Elim1Store]: Index analysis took 192 ms [2024-11-14 02:53:34,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,654 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:34,802 INFO L349 Elim1Store]: treesize reduction 141, result has 5.4 percent of original size [2024-11-14 02:53:34,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 53 [2024-11-14 02:53:35,654 INFO L224 Elim1Store]: Index analysis took 302 ms [2024-11-14 02:53:35,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:35,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:35,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:35,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:36,169 INFO L349 Elim1Store]: treesize reduction 343, result has 7.0 percent of original size [2024-11-14 02:53:36,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 65 treesize of output 73 [2024-11-14 02:53:36,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:36,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:36,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:36,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:36,636 INFO L224 Elim1Store]: Index analysis took 297 ms [2024-11-14 02:53:36,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:36,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:36,660 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:36,661 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:36,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:36,711 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:36,712 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:36,917 INFO L349 Elim1Store]: treesize reduction 248, result has 1.6 percent of original size [2024-11-14 02:53:36,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 54 [2024-11-14 02:53:37,298 INFO L224 Elim1Store]: Index analysis took 242 ms [2024-11-14 02:53:37,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:37,346 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:37,430 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:37,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:38,082 INFO L349 Elim1Store]: treesize reduction 567, result has 5.7 percent of original size [2024-11-14 02:53:38,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 24 case distinctions, treesize of input 77 treesize of output 91 [2024-11-14 02:53:38,591 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:38,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:38,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:38,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:38,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:38,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:38,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:38,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:38,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:38,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:38,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:38,812 INFO L349 Elim1Store]: treesize reduction 145, result has 2.7 percent of original size [2024-11-14 02:53:38,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 72 treesize of output 59 [2024-11-14 02:53:39,408 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:39,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:39,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:39,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:39,485 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:39,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,503 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,508 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 02:53:39,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 45 [2024-11-14 02:53:39,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,721 INFO L224 Elim1Store]: Index analysis took 188 ms [2024-11-14 02:53:39,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,754 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:39,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:40,168 INFO L349 Elim1Store]: treesize reduction 341, result has 7.6 percent of original size [2024-11-14 02:53:40,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 70 treesize of output 80 [2024-11-14 02:53:40,499 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:40,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:40,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:40,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:40,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:40,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:40,571 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:40,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:53:40,584 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:40,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:40,693 INFO L349 Elim1Store]: treesize reduction 145, result has 2.7 percent of original size [2024-11-14 02:53:40,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 54 [2024-11-14 02:53:41,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:41,250 INFO L224 Elim1Store]: Index analysis took 164 ms [2024-11-14 02:53:41,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:41,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:41,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:41,277 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:41,589 INFO L349 Elim1Store]: treesize reduction 351, result has 2.5 percent of original size [2024-11-14 02:53:41,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 61 [2024-11-14 02:53:42,105 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:42,116 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:42,194 INFO L224 Elim1Store]: Index analysis took 227 ms [2024-11-14 02:53:42,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:42,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:42,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:42,269 INFO L349 Elim1Store]: treesize reduction 142, result has 0.7 percent of original size [2024-11-14 02:53:42,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 45 [2024-11-14 02:53:42,592 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:42,650 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:53:42,650 INFO L224 Elim1Store]: Index analysis took 259 ms [2024-11-14 02:54:07,272 WARN L286 SmtUtils]: Spent 24.61s on a formula simplification. DAG size of input: 495 DAG size of output: 134 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 02:54:07,272 INFO L349 Elim1Store]: treesize reduction 2387, result has 11.4 percent of original size [2024-11-14 02:54:07,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 86 case distinctions, treesize of input 289 treesize of output 1398