./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:44:20,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:44:20,162 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:44:20,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:44:20,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:44:20,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:44:20,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:44:20,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:44:20,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:44:20,215 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:44:20,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:44:20,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:44:20,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:44:20,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:44:20,217 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:44:20,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:44:20,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:44:20,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:44:20,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:44:20,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:44:20,218 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:44:20,218 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:44:20,218 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:44:20,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:44:20,218 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:44:20,219 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:44:20,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:44:20,219 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:44:20,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:44:20,219 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:44:20,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:44:20,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:44:20,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:44:20,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:44:20,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:44:20,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:44:20,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:44:20,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:44:20,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:44:20,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:44:20,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:44:20,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:44:20,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:44:20,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:44:20,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:44:20,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:44:20,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:44:20,222 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2024-11-28 04:44:20,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:44:20,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:44:20,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:44:20,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:44:20,635 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:44:20,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2024-11-28 04:44:24,110 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/data/b4323b05f/32bed94196714b06b402bafa7545600a/FLAG802049505 [2024-11-28 04:44:24,647 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:44:24,648 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2024-11-28 04:44:24,680 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/data/b4323b05f/32bed94196714b06b402bafa7545600a/FLAG802049505 [2024-11-28 04:44:24,719 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/data/b4323b05f/32bed94196714b06b402bafa7545600a [2024-11-28 04:44:24,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:44:24,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:44:24,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:44:24,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:44:24,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:44:24,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:44:24" (1/1) ... [2024-11-28 04:44:24,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408c2eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:24, skipping insertion in model container [2024-11-28 04:44:24,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:44:24" (1/1) ... [2024-11-28 04:44:24,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:44:25,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:44:25,293 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:44:25,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:44:25,393 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:44:25,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25 WrapperNode [2024-11-28 04:44:25,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:44:25,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:44:25,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:44:25,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:44:25,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,459 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2024-11-28 04:44:25,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:44:25,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:44:25,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:44:25,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:44:25,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,506 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-28 04:44:25,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:44:25,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:44:25,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:44:25,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:44:25,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (1/1) ... [2024-11-28 04:44:25,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:44:25,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:25,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:44:25,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:44:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 04:44:25,626 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 04:44:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:44:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:44:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:44:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:44:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:44:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:44:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:44:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:44:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:44:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:44:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:44:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:44:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:44:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:44:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:44:25,782 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:44:25,785 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:44:25,818 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 04:44:26,142 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-28 04:44:26,142 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:44:26,159 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:44:26,161 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 04:44:26,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:44:26 BoogieIcfgContainer [2024-11-28 04:44:26,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:44:26,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:44:26,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:44:26,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:44:26,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:44:24" (1/3) ... [2024-11-28 04:44:26,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84a08a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:44:26, skipping insertion in model container [2024-11-28 04:44:26,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:44:25" (2/3) ... [2024-11-28 04:44:26,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84a08a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:44:26, skipping insertion in model container [2024-11-28 04:44:26,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:44:26" (3/3) ... [2024-11-28 04:44:26,174 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2024-11-28 04:44:26,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:44:26,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_circular_traversal-2.i that has 2 procedures, 68 locations, 1 initial locations, 3 loop locations, and 25 error locations. [2024-11-28 04:44:26,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:44:26,262 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=PETRI_NET, 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;@6ddf0420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:44:26,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-28 04:44:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 65 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:44:26,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:26,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:44:26,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:26,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-28 04:44:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660957575] [2024-11-28 04:44:26,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:26,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:26,595 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-28 04:44:26,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:26,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660957575] [2024-11-28 04:44:26,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660957575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:26,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:44:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022605578] [2024-11-28 04:44:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:26,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:44:26,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:26,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:44:26,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:44:26,645 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 65 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:26,814 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2024-11-28 04:44:26,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:44:26,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 04:44:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:26,821 INFO L225 Difference]: With dead ends: 63 [2024-11-28 04:44:26,821 INFO L226 Difference]: Without dead ends: 57 [2024-11-28 04:44:26,823 INFO L434 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-28 04:44:26,826 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:26,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 82 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:44:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-28 04:44:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-28 04:44:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2024-11-28 04:44:26,870 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 4 [2024-11-28 04:44:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:26,871 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2024-11-28 04:44:26,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2024-11-28 04:44:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:44:26,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:26,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:44:26,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:44:26,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:26,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-28 04:44:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:26,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668675542] [2024-11-28 04:44:26,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:27,069 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-28 04:44:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:27,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668675542] [2024-11-28 04:44:27,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668675542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:27,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:44:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894455072] [2024-11-28 04:44:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:27,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:44:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:27,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:44:27,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:44:27,073 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:27,173 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-11-28 04:44:27,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:44:27,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 04:44:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:27,175 INFO L225 Difference]: With dead ends: 54 [2024-11-28 04:44:27,175 INFO L226 Difference]: Without dead ends: 54 [2024-11-28 04:44:27,175 INFO L434 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-28 04:44:27,177 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:27,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:44:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-28 04:44:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-28 04:44:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-11-28 04:44:27,183 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2024-11-28 04:44:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:27,184 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-11-28 04:44:27,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-11-28 04:44:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:44:27,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:27,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:27,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:44:27,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:27,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash -401893041, now seen corresponding path program 1 times [2024-11-28 04:44:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:27,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455583802] [2024-11-28 04:44:27,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:27,300 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-28 04:44:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455583802] [2024-11-28 04:44:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455583802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:27,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:44:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141748811] [2024-11-28 04:44:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:27,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:44:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:27,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:44:27,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:44:27,302 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:27,400 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-11-28 04:44:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:44:27,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 04:44:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:27,401 INFO L225 Difference]: With dead ends: 52 [2024-11-28 04:44:27,401 INFO L226 Difference]: Without dead ends: 52 [2024-11-28 04:44:27,402 INFO L434 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-28 04:44:27,403 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:27,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:44:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-28 04:44:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-28 04:44:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-11-28 04:44:27,408 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 10 [2024-11-28 04:44:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:27,409 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-11-28 04:44:27,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-11-28 04:44:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:44:27,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:27,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:27,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:44:27,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:27,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash -401893040, now seen corresponding path program 1 times [2024-11-28 04:44:27,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:27,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970960779] [2024-11-28 04:44:27,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:27,606 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-28 04:44:27,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:27,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970960779] [2024-11-28 04:44:27,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970960779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:27,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:27,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:44:27,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090599337] [2024-11-28 04:44:27,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:27,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:44:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:27,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:44:27,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:44:27,608 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:27,693 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2024-11-28 04:44:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:44:27,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 04:44:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:27,697 INFO L225 Difference]: With dead ends: 50 [2024-11-28 04:44:27,697 INFO L226 Difference]: Without dead ends: 50 [2024-11-28 04:44:27,698 INFO L434 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-28 04:44:27,698 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:27,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:44:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-28 04:44:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-28 04:44:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-11-28 04:44:27,709 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 10 [2024-11-28 04:44:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:27,709 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-28 04:44:27,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-11-28 04:44:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:44:27,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:27,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:27,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:44:27,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:27,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash 428615805, now seen corresponding path program 1 times [2024-11-28 04:44:27,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:27,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841561036] [2024-11-28 04:44:27,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:27,932 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-28 04:44:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841561036] [2024-11-28 04:44:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841561036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:27,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:44:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264218131] [2024-11-28 04:44:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:27,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:44:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:27,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:44:27,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:44:27,935 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:27,951 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-11-28 04:44:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:44:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 04:44:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:27,952 INFO L225 Difference]: With dead ends: 56 [2024-11-28 04:44:27,952 INFO L226 Difference]: Without dead ends: 56 [2024-11-28 04:44:27,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 04:44:27,954 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:27,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:44:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-28 04:44:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-28 04:44:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.5) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-11-28 04:44:27,959 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 11 [2024-11-28 04:44:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:27,960 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-11-28 04:44:27,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-11-28 04:44:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:44:27,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:27,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:27,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:44:27,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:27,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1010923860, now seen corresponding path program 1 times [2024-11-28 04:44:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:27,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703111662] [2024-11-28 04:44:27,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:27,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703111662] [2024-11-28 04:44:28,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703111662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:28,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711658660] [2024-11-28 04:44:28,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:28,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:28,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:28,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:44:28,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:44:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:28,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:44:28,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:44:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:28,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:44:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711658660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:44:28,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:44:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-28 04:44:28,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101919016] [2024-11-28 04:44:28,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:44:28,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:44:28,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:28,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:44:28,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:44:28,491 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:28,533 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-28 04:44:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:44:28,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 04:44:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:28,535 INFO L225 Difference]: With dead ends: 69 [2024-11-28 04:44:28,535 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 04:44:28,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:44:28,537 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:28,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 143 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:44:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 04:44:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-28 04:44:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-28 04:44:28,551 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 17 [2024-11-28 04:44:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:28,551 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-28 04:44:28,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-28 04:44:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 04:44:28,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:28,556 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:28,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 04:44:28,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:28,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:28,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash -663241639, now seen corresponding path program 2 times [2024-11-28 04:44:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:28,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458471221] [2024-11-28 04:44:28,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:44:28,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:28,813 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:44:28,813 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:44:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-28 04:44:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458471221] [2024-11-28 04:44:29,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458471221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:29,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:29,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:44:29,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360890182] [2024-11-28 04:44:29,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:29,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:44:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:29,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:44:29,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:44:29,124 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:29,344 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-11-28 04:44:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:44:29,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-28 04:44:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:29,346 INFO L225 Difference]: With dead ends: 66 [2024-11-28 04:44:29,346 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 04:44:29,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:44:29,347 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:29,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 105 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:44:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 04:44:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 04:44:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-11-28 04:44:29,354 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2024-11-28 04:44:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:29,354 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-11-28 04:44:29,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-11-28 04:44:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 04:44:29,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:29,356 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:29,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:44:29,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:29,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash -663241638, now seen corresponding path program 1 times [2024-11-28 04:44:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072006445] [2024-11-28 04:44:29,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-28 04:44:29,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:29,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072006445] [2024-11-28 04:44:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072006445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:44:29,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:44:29,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:44:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430237383] [2024-11-28 04:44:29,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:44:29,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:44:29,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:29,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:44:29,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:44:29,931 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:30,132 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2024-11-28 04:44:30,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:44:30,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-28 04:44:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:30,135 INFO L225 Difference]: With dead ends: 73 [2024-11-28 04:44:30,135 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 04:44:30,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:44:30,136 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:30,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 137 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:44:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 04:44:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2024-11-28 04:44:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-28 04:44:30,148 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 35 [2024-11-28 04:44:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:30,148 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-28 04:44:30,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-28 04:44:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 04:44:30,150 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:30,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:30,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:44:30,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash 590361197, now seen corresponding path program 1 times [2024-11-28 04:44:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089441714] [2024-11-28 04:44:30,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:44:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089441714] [2024-11-28 04:44:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089441714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104405265] [2024-11-28 04:44:32,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:32,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:32,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:32,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:44:32,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:44:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:32,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 04:44:32,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:44:32,743 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-28 04:44:32,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:44:32,909 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 25 treesize of output 13 [2024-11-28 04:44:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-28 04:44:33,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-28 04:44:33,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104405265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:44:33,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:44:33,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2024-11-28 04:44:33,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81180938] [2024-11-28 04:44:33,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:44:33,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 04:44:33,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:33,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 04:44:33,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2024-11-28 04:44:33,802 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:34,566 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-28 04:44:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:44:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-28 04:44:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:34,567 INFO L225 Difference]: With dead ends: 69 [2024-11-28 04:44:34,568 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 04:44:34,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2024-11-28 04:44:34,569 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:34,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 580 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:44:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 04:44:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-28 04:44:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-28 04:44:34,583 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 39 [2024-11-28 04:44:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:34,583 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-28 04:44:34,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-28 04:44:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 04:44:34,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:34,587 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:34,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:44:34,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:34,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:34,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash 411868972, now seen corresponding path program 1 times [2024-11-28 04:44:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060433649] [2024-11-28 04:44:34,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:44:36,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:36,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060433649] [2024-11-28 04:44:36,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060433649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:36,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059601878] [2024-11-28 04:44:36,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:36,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:36,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:36,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:44:36,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:44:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:36,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 04:44:36,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:44:36,756 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-28 04:44:36,839 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:44:36,840 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 14 treesize of output 13 [2024-11-28 04:44:36,926 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-28 04:44:36,944 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-28 04:44:37,016 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-28 04:44:37,030 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 23 treesize of output 11 [2024-11-28 04:44:37,157 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-28 04:44:37,157 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 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-28 04:44:37,184 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:44:37,184 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 04:44:37,692 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 39 treesize of output 27 [2024-11-28 04:44:37,703 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:44:37,703 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2024-11-28 04:44:37,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:44:37,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2024-11-28 04:44:37,774 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 23 treesize of output 15 [2024-11-28 04:44:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:44:37,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:44:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059601878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:44:38,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:44:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 32 [2024-11-28 04:44:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780546882] [2024-11-28 04:44:38,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:44:38,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 04:44:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:38,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 04:44:38,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 04:44:38,709 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:40,160 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-11-28 04:44:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:44:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 04:44:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:40,162 INFO L225 Difference]: With dead ends: 81 [2024-11-28 04:44:40,162 INFO L226 Difference]: Without dead ends: 81 [2024-11-28 04:44:40,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2024-11-28 04:44:40,164 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:40,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 369 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 04:44:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-28 04:44:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2024-11-28 04:44:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-28 04:44:40,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 41 [2024-11-28 04:44:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:40,169 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-28 04:44:40,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-28 04:44:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 04:44:40,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:40,170 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:40,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:44:40,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:40,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:40,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:40,372 INFO L85 PathProgramCache]: Analyzing trace with hash 411868973, now seen corresponding path program 1 times [2024-11-28 04:44:40,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:40,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635554966] [2024-11-28 04:44:40,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:40,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:44:41,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635554966] [2024-11-28 04:44:41,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635554966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:41,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256147899] [2024-11-28 04:44:41,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:41,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:41,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:41,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:44:42,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:44:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:42,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 04:44:42,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:44:42,256 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-28 04:44:42,321 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:44:42,321 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 14 treesize of output 13 [2024-11-28 04:44:42,410 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-28 04:44:42,427 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-28 04:44:42,489 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 25 treesize of output 13 [2024-11-28 04:44:42,502 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 23 treesize of output 11 [2024-11-28 04:44:42,615 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-28 04:44:42,616 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 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-28 04:44:42,636 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 04:44:42,636 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 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:44:43,122 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:44:43,122 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-11-28 04:44:43,134 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:44:43,134 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 52 [2024-11-28 04:44:43,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:44:43,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2024-11-28 04:44:43,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:44:43,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2024-11-28 04:44:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:44:43,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:44:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256147899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:44:44,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:44:44,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 33 [2024-11-28 04:44:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724814117] [2024-11-28 04:44:44,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:44:44,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 04:44:44,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:44,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 04:44:44,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 04:44:44,591 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:49,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:44:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:49,613 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-28 04:44:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 04:44:49,614 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 04:44:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:49,615 INFO L225 Difference]: With dead ends: 88 [2024-11-28 04:44:49,615 INFO L226 Difference]: Without dead ends: 88 [2024-11-28 04:44:49,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2024-11-28 04:44:49,619 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 66 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:49,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 429 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 743 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-11-28 04:44:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-28 04:44:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2024-11-28 04:44:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-28 04:44:49,629 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 41 [2024-11-28 04:44:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:49,629 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-28 04:44:49,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:44:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-28 04:44:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 04:44:49,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:49,634 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:49,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:44:49,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:49,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:44:49,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1247710272, now seen corresponding path program 1 times [2024-11-28 04:44:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:49,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175990639] [2024-11-28 04:44:49,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:44:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 04:44:52,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:44:52,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175990639] [2024-11-28 04:44:52,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175990639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:52,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584108385] [2024-11-28 04:44:52,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:52,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:52,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:52,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:44:52,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:44:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:52,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-28 04:44:52,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:44:52,542 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-28 04:44:52,758 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-28 04:44:52,768 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-28 04:44:52,792 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:44:52,793 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 04:44:52,889 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 23 treesize of output 11 [2024-11-28 04:44:52,899 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 35 treesize of output 19 [2024-11-28 04:44:52,924 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:44:52,924 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 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-28 04:44:53,081 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-28 04:44:53,082 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 1 case distinctions, treesize of input 31 treesize of output 30 [2024-11-28 04:44:53,103 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 04:44:53,103 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 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:44:53,115 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 27 treesize of output 15 [2024-11-28 04:44:53,668 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:44:53,668 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2024-11-28 04:44:53,694 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:44:53,695 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 1 case distinctions, treesize of input 43 treesize of output 46 [2024-11-28 04:44:53,710 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:44:53,711 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2024-11-28 04:44:53,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:44:53,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2024-11-28 04:44:53,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:44:53,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2024-11-28 04:44:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:44:54,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:55,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (and (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) .cse0) .cse1)))) (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) .cse0) .cse1)) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-28 04:45:02,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:45:02,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 80 [2024-11-28 04:45:03,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:45:03,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 80 [2024-11-28 04:45:04,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_4 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| v_subst_4 v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) v_subst_4 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_4)))) (or .cse0 .cse2 (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse0 (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (or (and (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_2 Int)) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| v_subst_2 v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) v_subst_2 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse0) (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_3 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_3) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) v_subst_3 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1))))) .cse2) (forall ((v_subst_5 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5) (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_958)) v_subst_5 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5))))))) is different from false [2024-11-28 04:45:04,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:45:04,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-28 04:45:04,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:45:04,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 8 [2024-11-28 04:45:04,829 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-28 04:45:04,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2024-11-28 04:45:04,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:45:04,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 20 [2024-11-28 04:45:04,888 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:45:04,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2024-11-28 04:45:04,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:45:04,903 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-28 04:45:04,912 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 36 treesize of output 24 [2024-11-28 04:45:04,921 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 3 [2024-11-28 04:45:04,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:45:04,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 31 [2024-11-28 04:45:04,979 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 36 treesize of output 24 [2024-11-28 04:45:04,988 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 3 [2024-11-28 04:45:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2024-11-28 04:45:05,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584108385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:45:05,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:45:05,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 18] total 49 [2024-11-28 04:45:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032204929] [2024-11-28 04:45:05,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:45:05,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-28 04:45:05,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:45:05,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-28 04:45:05,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1972, Unknown=49, NotChecked=182, Total=2352 [2024-11-28 04:45:05,412 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 49 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 49 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:08,844 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-11-28 04:45:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:45:08,845 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 49 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-28 04:45:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:08,846 INFO L225 Difference]: With dead ends: 80 [2024-11-28 04:45:08,846 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 04:45:08,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=331, Invalid=3168, Unknown=49, NotChecked=234, Total=3782 [2024-11-28 04:45:08,849 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:08,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 659 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 780 Invalid, 0 Unknown, 79 Unchecked, 1.8s Time] [2024-11-28 04:45:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 04:45:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-28 04:45:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-28 04:45:08,855 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 45 [2024-11-28 04:45:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:08,860 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-28 04:45:08,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 49 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-28 04:45:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 04:45:08,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:08,865 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:08,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:45:09,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 04:45:09,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:45:09,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1836651794, now seen corresponding path program 1 times [2024-11-28 04:45:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:45:09,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314942070] [2024-11-28 04:45:09,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:45:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:45:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:45:10,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314942070] [2024-11-28 04:45:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314942070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:45:10,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130684179] [2024-11-28 04:45:10,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:10,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:10,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:10,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:45:10,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:45:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:10,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 04:45:10,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:45:10,429 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-28 04:45:10,487 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:45:10,487 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 19 treesize of output 16 [2024-11-28 04:45:10,530 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:45:10,531 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-28 04:45:10,615 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:45:10,615 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-28 04:45:10,888 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 04:45:10,888 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-28 04:45:11,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-28 04:45:11,107 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 36 treesize of output 16 [2024-11-28 04:45:11,244 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 25 treesize of output 18 [2024-11-28 04:45:11,516 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 28 treesize of output 12 [2024-11-28 04:45:11,554 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 16 treesize of output 8 [2024-11-28 04:45:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:45:11,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:45:11,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-28 04:45:11,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-28 04:45:11,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1135 (Array Int Int))) (or (not (= v_ArrVal_1135 (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1135 .cse0))))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-11-28 04:45:11,646 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 41 treesize of output 39 [2024-11-28 04:45:11,653 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 22 treesize of output 20 [2024-11-28 04:45:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2024-11-28 04:45:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130684179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:45:12,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:45:12,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 30 [2024-11-28 04:45:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681502043] [2024-11-28 04:45:12,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:45:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 04:45:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:45:12,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 04:45:12,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=620, Unknown=3, NotChecked=156, Total=870 [2024-11-28 04:45:12,520 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:13,771 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-28 04:45:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:45:13,771 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-28 04:45:13,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:13,772 INFO L225 Difference]: With dead ends: 74 [2024-11-28 04:45:13,772 INFO L226 Difference]: Without dead ends: 74 [2024-11-28 04:45:13,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=938, Unknown=3, NotChecked=198, Total=1332 [2024-11-28 04:45:13,773 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:13,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 448 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 419 Invalid, 0 Unknown, 106 Unchecked, 0.7s Time] [2024-11-28 04:45:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-28 04:45:13,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-28 04:45:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.203125) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-28 04:45:13,778 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 46 [2024-11-28 04:45:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:13,778 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-28 04:45:13,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-28 04:45:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:45:13,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:13,779 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:13,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:45:13,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:13,980 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:45:13,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash -743254081, now seen corresponding path program 2 times [2024-11-28 04:45:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:45:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129371072] [2024-11-28 04:45:13,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:45:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:45:14,069 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:45:14,069 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:45:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:45:17,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:45:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129371072] [2024-11-28 04:45:17,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129371072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:45:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144276665] [2024-11-28 04:45:17,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:45:17,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:17,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:17,848 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:45:17,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:45:18,087 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:45:18,087 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:45:18,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-28 04:45:18,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:45:18,111 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-28 04:45:18,280 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:45:18,281 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 19 treesize of output 16 [2024-11-28 04:45:18,347 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:45:18,347 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-28 04:45:18,714 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-11-28 04:45:18,714 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 24 treesize of output 28 [2024-11-28 04:45:18,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-28 04:45:18,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-28 04:45:19,072 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 23 treesize of output 11 [2024-11-28 04:45:19,087 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 33 treesize of output 17 [2024-11-28 04:45:19,352 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2024-11-28 04:45:19,352 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 23 treesize of output 33 [2024-11-28 04:45:19,634 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-28 04:45:19,634 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 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-28 04:45:19,686 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-28 04:45:19,687 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 1 case distinctions, treesize of input 57 treesize of output 37 [2024-11-28 04:45:19,991 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:45:19,991 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 1 case distinctions, treesize of input 115 treesize of output 65 [2024-11-28 04:45:20,006 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 04:45:20,006 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 1 case distinctions, treesize of input 42 treesize of output 33 [2024-11-28 04:45:20,604 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-28 04:45:20,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 76 [2024-11-28 04:45:20,660 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-28 04:45:20,661 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-28 04:45:22,917 INFO L349 Elim1Store]: treesize reduction 168, result has 0.6 percent of original size [2024-11-28 04:45:22,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 263 treesize of output 208 [2024-11-28 04:45:22,937 INFO L349 Elim1Store]: treesize reduction 192, result has 0.5 percent of original size [2024-11-28 04:45:22,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 270 treesize of output 260 [2024-11-28 04:45:25,784 INFO L349 Elim1Store]: treesize reduction 196, result has 31.5 percent of original size [2024-11-28 04:45:25,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 186 treesize of output 191 [2024-11-28 04:45:26,203 INFO L349 Elim1Store]: treesize reduction 188, result has 32.4 percent of original size [2024-11-28 04:45:26,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 129 treesize of output 171 [2024-11-28 04:45:30,718 INFO L349 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2024-11-28 04:45:30,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 224 treesize of output 199 [2024-11-28 04:45:30,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:45:30,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 119 treesize of output 195 [2024-11-28 04:46:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:46:12,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:46:38,348 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1327))) (let ((.cse4 (select v_ArrVal_1327 0)) (.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1326)) (.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse3 (select v_ArrVal_1326 0)) (.cse5 (select v_ArrVal_1333 0))) (or (not (= v_ArrVal_1333 (store (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1333 4)))) (= (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|)) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (not (= (select |c_#valid| .cse3) 1)) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse4) (not (= v_ArrVal_1327 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse4) 4 (select v_ArrVal_1327 4)))) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323) (select (select .cse2 .cse3) .cse5)) 1) (not (= v_ArrVal_1326 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1326 4)))) (< .cse5 0) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1333) .cse3) .cse5) 0))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1334 Int) (v_ArrVal_1323 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1327))) (let ((.cse10 (select v_ArrVal_1327 0)) (.cse8 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323)) (.cse7 (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse9 (select v_ArrVal_1326 0)) (.cse11 (select v_ArrVal_1333 0))) (or (not (= v_ArrVal_1333 (store (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse7) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1333 4)))) (not (= (select .cse8 .cse9) 1)) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse10) (not (= v_ArrVal_1327 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse10) 4 (select v_ArrVal_1327 4)))) (not (= v_ArrVal_1326 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1326 4)))) (< .cse11 0) (= 1 (select .cse8 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1326))) (let ((.cse12 (store (select .cse13 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse12) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (select (store .cse13 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse12) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 v_ArrVal_1334)))) .cse9) .cse11))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse7) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1333) .cse9) .cse11) 0) (= .cse11 0))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1334 Int) (v_ArrVal_1323 Int)) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1326))) (let ((.cse19 (store (select .cse20 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse17 (select (store .cse20 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse19) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse16 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse19) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse17 4 v_ArrVal_1334))) (.cse14 (select v_ArrVal_1326 0)) (.cse15 (select v_ArrVal_1327 0))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323) .cse14) 1)) (< .cse15 0) (= (select (select .cse16 (select .cse17 0)) (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1327))) (store .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0)) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (= (select |c_#valid| (select (select .cse16 .cse14) .cse15)) 1) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse15) (not (= v_ArrVal_1327 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse15) 4 (select v_ArrVal_1327 4)))) (not (= v_ArrVal_1326 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1326 4))))))))))) is different from false [2024-11-28 04:46:39,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1321 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1321 .cse1)) v_ArrVal_1321)) (forall ((v_ArrVal_1322 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1334 Int) (v_ArrVal_1323 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1322))) (let ((.cse10 (store .cse8 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1327))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323)) (.cse6 (select v_ArrVal_1326 0)) (.cse9 (store (select .cse10 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse11 (select v_ArrVal_1327 0)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1321)) (.cse7 (select v_ArrVal_1333 0))) (or (= (select .cse2 (select (select (let ((.cse5 (store .cse3 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1326))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse4) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse4) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 v_ArrVal_1334)))) .cse6) .cse7)) 1) (not (= (select .cse2 .cse6) 1)) (= (select (select (store (store .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse9) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1333) .cse6) .cse7) 0) (not (= (store (select (store .cse10 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse9) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1333 4)) v_ArrVal_1333)) (not (= (store (store (select .cse8 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse11) 4 (select v_ArrVal_1327 4)) v_ArrVal_1327)) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse11) (< .cse7 0) (not (= (store (store (select .cse3 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1326 4)) v_ArrVal_1326)) (= .cse7 0)))))) (not (= (store .cse12 .cse1 (select v_ArrVal_1322 .cse1)) v_ArrVal_1322)))))) (forall ((v_ArrVal_1321 (Array Int Int))) (or (forall ((v_ArrVal_1322 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1322))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1321)) (.cse18 (store .cse13 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1327))) (let ((.cse14 (store (select .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse15 (select v_ArrVal_1326 0)) (.cse19 (select v_ArrVal_1327 0)) (.cse16 (select v_ArrVal_1333 0)) (.cse17 (store .cse20 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1326))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse14) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1333) .cse15) .cse16) 0) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323) (select (select .cse17 .cse15) .cse16)) 1) (not (= (store (select (store .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse14) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1333 4)) v_ArrVal_1333)) (not (= (select |c_#valid| .cse15) 1)) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse19) (not (= v_ArrVal_1327 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse19) 4 (select v_ArrVal_1327 4)))) (< .cse16 0) (not (= (store (store (select .cse20 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1326 4)) v_ArrVal_1326)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|)) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))))))) (not (= (store .cse12 .cse1 (select v_ArrVal_1322 .cse1)) v_ArrVal_1322)))) (not (= (store .cse0 .cse1 (select v_ArrVal_1321 .cse1)) v_ArrVal_1321)))) (forall ((v_ArrVal_1321 (Array Int Int))) (or (forall ((v_ArrVal_1322 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1334 Int) (v_ArrVal_1323 Int)) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1321))) (let ((.cse29 (store .cse27 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1326))) (let ((.cse28 (store (select .cse29 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse22 (select (store .cse29 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse28) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse21 (store (store .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse28) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse22 4 v_ArrVal_1334))) (.cse25 (select v_ArrVal_1326 0)) (.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1322)) (.cse26 (select v_ArrVal_1327 0))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (select (select .cse21 (select .cse22 0)) (select (select (let ((.cse23 (store .cse24 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1327))) (store .cse23 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323) .cse25) 1)) (< .cse26 0) (= (select |c_#valid| (select (select .cse21 .cse25) .cse26)) 1) (not (= (store (store (select .cse24 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse26) 4 (select v_ArrVal_1327 4)) v_ArrVal_1327)) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse26) (not (= (store (store (select .cse27 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1326 4)) v_ArrVal_1326))))))))) (not (= (store .cse12 .cse1 (select v_ArrVal_1322 .cse1)) v_ArrVal_1322)))) (not (= (store .cse0 .cse1 (select v_ArrVal_1321 .cse1)) v_ArrVal_1321)))))) is different from false [2024-11-28 04:46:40,912 INFO L349 Elim1Store]: treesize reduction 118, result has 51.0 percent of original size [2024-11-28 04:46:40,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 10309 treesize of output 10200 [2024-11-28 04:46:41,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:41,268 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 11380 treesize of output 11272 [2024-11-28 04:46:42,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-28 04:46:42,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:42,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:42,365 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:42,496 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-28 04:46:42,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 11 [2024-11-28 04:46:42,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:42,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:46:42,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:42,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:46:44,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:44,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:46:44,938 INFO L349 Elim1Store]: treesize reduction 36, result has 50.0 percent of original size [2024-11-28 04:46:44,939 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 265 [2024-11-28 04:46:45,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:45,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:45,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-28 04:46:45,362 INFO L349 Elim1Store]: treesize reduction 42, result has 41.7 percent of original size [2024-11-28 04:46:45,363 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 259 [2024-11-28 04:46:45,397 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:45,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:45,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 04:46:45,862 INFO L349 Elim1Store]: treesize reduction 36, result has 50.0 percent of original size [2024-11-28 04:46:45,862 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 312 treesize of output 331 [2024-11-28 04:46:45,976 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:45,977 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:45,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-28 04:46:46,669 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:46,678 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:46,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:46,712 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:47,329 INFO L349 Elim1Store]: treesize reduction 446, result has 19.2 percent of original size [2024-11-28 04:46:47,330 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 5 new quantified variables, introduced 15 case distinctions, treesize of input 1182 treesize of output 1221 [2024-11-28 04:46:49,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:46:49,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2024-11-28 04:46:49,436 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:49,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:49,449 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:49,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:49,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:49,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:49,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 701 treesize of output 717 [2024-11-28 04:46:50,191 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,212 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,233 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,241 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:50,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 175 [2024-11-28 04:46:50,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,899 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:50,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:51,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:51,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 701 treesize of output 717 [2024-11-28 04:46:55,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:46:56,168 INFO L349 Elim1Store]: treesize reduction 44, result has 56.4 percent of original size [2024-11-28 04:46:56,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 7172 treesize of output 6622 [2024-11-28 04:47:45,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:47:45,427 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 5893 treesize of output 5429 [2024-11-28 04:48:47,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:48:47,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:48,030 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-11-28 04:48:48,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 539 treesize of output 549 [2024-11-28 04:48:48,111 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:48,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:48,197 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 2 case distinctions, treesize of input 213 treesize of output 213 [2024-11-28 04:48:48,555 INFO L349 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2024-11-28 04:48:48,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 379 treesize of output 385 [2024-11-28 04:48:48,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:48,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:48:48,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:48,984 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 139 treesize of output 127 [2024-11-28 04:48:49,103 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:49,113 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 34 treesize of output 30 [2024-11-28 04:48:49,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:49,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:48:49,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:49,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:48:49,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:49,458 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-28 04:48:49,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2024-11-28 04:48:49,506 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:48:49,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:49,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 121 [2024-11-28 04:48:49,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:49,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 85 [2024-11-28 04:48:51,358 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-11-28 04:48:51,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2320 treesize of output 2314 [2024-11-28 04:48:51,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:48:51,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:51,725 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 609 [2024-11-28 04:48:52,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-28 04:48:52,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:52,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:48:52,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:52,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:52,535 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:52,545 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:52,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:52,786 INFO L349 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2024-11-28 04:48:52,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 208 treesize of output 234 [2024-11-28 04:48:53,567 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:53,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:53,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 204 treesize of output 218 [2024-11-28 04:48:55,058 INFO L349 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2024-11-28 04:48:55,059 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 160 [2024-11-28 04:48:55,499 INFO L349 Elim1Store]: treesize reduction 94, result has 32.4 percent of original size [2024-11-28 04:48:55,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 190 treesize of output 218 [2024-11-28 04:48:56,012 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-28 04:48:56,012 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 34 treesize of output 24 [2024-11-28 04:48:57,193 INFO L349 Elim1Store]: treesize reduction 169, result has 31.6 percent of original size [2024-11-28 04:48:57,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 1192 treesize of output 1245 [2024-11-28 04:48:57,917 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:58,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:58,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 1042 treesize of output 1082 [2024-11-28 04:48:59,453 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:48:59,921 INFO L349 Elim1Store]: treesize reduction 216, result has 24.5 percent of original size [2024-11-28 04:48:59,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 574 treesize of output 601 [2024-11-28 04:49:00,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:00,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:00,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:00,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:00,339 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 04:49:00,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 58 [2024-11-28 04:49:02,118 INFO L349 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2024-11-28 04:49:02,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 684 treesize of output 670 [2024-11-28 04:49:09,932 INFO L349 Elim1Store]: treesize reduction 16, result has 78.1 percent of original size [2024-11-28 04:49:09,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 1281 treesize of output 1191 [2024-11-28 04:52:34,706 WARN L286 SmtUtils]: Spent 1.41m on a formula simplification. DAG size of input: 2784 DAG size of output: 2563 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:53:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-28 04:53:30,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144276665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:53:30,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:53:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 62 [2024-11-28 04:53:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912583350] [2024-11-28 04:53:30,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:53:30,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-28 04:53:30,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:30,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-28 04:53:30,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3413, Unknown=13, NotChecked=238, Total=3906 [2024-11-28 04:53:30,820 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 63 states, 62 states have (on average 2.1774193548387095) internal successors, (135), 63 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:53:39,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:54:08,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (let ((.cse7 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse13)) (.cse6 (select |c_#memory_$Pointer$#1.base| .cse13)) (.cse3 (select |c_#memory_$Pointer$#1.offset| .cse13)) (.cse2 (<= .cse4 0)) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) (and (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1323 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (= (select (store (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)))) (or (and .cse2 (= (select .cse3 .cse4) 0) (let ((.cse5 (select .cse6 .cse4))) (or (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse5)))) .cse7) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1323 Int) (v_arrayElimCell_178 Int)) (let ((.cse8 (store (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (= (select .cse8 v_arrayElimCell_178) 1) (= (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|)))) .cse1) (or (not (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) .cse0) (or (and (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1323 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (= (select (store (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) .cse1) (or .cse1 (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1323 Int) (v_arrayElimCell_178 Int)) (let ((.cse9 (store (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (= (select .cse9 v_arrayElimCell_178) 1) (= (select .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)))))) .cse0) (let ((.cse11 (= (select .cse3 0) 0)) (.cse10 (select .cse6 0)) (.cse12 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_31| Int)) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_31|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_31|) 0) 0) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_31|) 1) (not (= |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_31| .cse13))))) (.cse14 (= .cse4 0))) (or (and (not .cse7) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse10) .cse11 .cse12) (and .cse12 .cse7 (exists ((v_arrayElimCell_77 Int)) (and (not (= v_arrayElimCell_77 .cse13)) (= (select |c_#valid| v_arrayElimCell_77) 1)))) (and (= (select |c_#valid| .cse10) 1) .cse11 (not (= .cse13 .cse10)) .cse12) (and .cse14 .cse7 (exists ((v_arrayElimIndex_2 Int)) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_2) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_2) 0) 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_arrayElimIndex_2))))) (and .cse14 (exists ((v_arrayElimIndex_2 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_2) 0))) (and (= (select |c_#valid| .cse15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_2) 0) 0) (not (= v_arrayElimIndex_2 .cse15))))) .cse7))) .cse2 (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1323 Int) (v_arrayElimCell_178 Int)) (let ((.cse16 (store (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (= (select .cse16 v_arrayElimCell_178) 1) (= (select .cse16 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse20 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323)) (.cse23 (select v_ArrVal_1326 0))) (or (forall ((v_ArrVal_1327 (Array Int Int))) (or (not (= v_ArrVal_1327 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 (select v_ArrVal_1327 4)))) (forall ((v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1334 Int)) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1327))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse19 (select v_ArrVal_1333 0))) (or (not (= v_ArrVal_1333 (store (select (store .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse18) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1333 4)))) (< .cse19 0) (= 1 (select .cse20 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1326))) (let ((.cse21 (store (select .cse22 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse21) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (select (store .cse22 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse21) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 v_ArrVal_1334)))) .cse23) .cse19))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse18) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1333) .cse23) .cse19) 0) (= .cse19 0))))))) (not (= (select .cse20 .cse23) 1)) (not (= (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 (select v_ArrVal_1326 4)) v_ArrVal_1326))))) .cse1 (= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse24 (select v_ArrVal_1326 0))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323) .cse24) 1)) (forall ((v_ArrVal_1327 (Array Int Int))) (let ((.cse28 (select v_ArrVal_1327 0))) (or (not (= v_ArrVal_1327 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 (select v_ArrVal_1327 4)))) (forall ((v_ArrVal_1334 Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1326))) (let ((.cse29 (store (select .cse30 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse26 (select (store .cse30 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse29) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse25 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse29) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse26 4 v_ArrVal_1334)))) (or (= (select (select .cse25 (select .cse26 0)) (select (select (let ((.cse27 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1327))) (store .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0)) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (= (select |c_#valid| (select (select .cse25 .cse24) .cse28)) 1))))))) (< .cse28 0)))) (not (= (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 (select v_ArrVal_1326 4)) v_ArrVal_1326))))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1323 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|) 0)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (= (select (store (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55| 1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_55|))) .cse1) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse31 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1326)) (.cse32 (select v_ArrVal_1326 0))) (or (= (select (select (store .cse31 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|)) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (not (= (select |c_#valid| .cse32) 1)) (not (= (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 (select v_ArrVal_1326 4)) v_ArrVal_1326)) (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1333 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1327))) (let ((.cse34 (store (select .cse33 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse35 (select v_ArrVal_1333 0))) (or (not (= v_ArrVal_1333 (store (select (store .cse33 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse34) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1333 4)))) (not (= v_ArrVal_1327 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 (select v_ArrVal_1327 4)))) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1323) (select (select .cse31 .cse32) .cse35)) 1) (< .cse35 0) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse34) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1333) .cse32) .cse35) 0))))))))))) is different from false [2024-11-28 04:54:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:20,069 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-28 04:54:20,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 04:54:20,070 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.1774193548387095) internal successors, (135), 63 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-28 04:54:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:20,070 INFO L225 Difference]: With dead ends: 84 [2024-11-28 04:54:20,071 INFO L226 Difference]: Without dead ends: 84 [2024-11-28 04:54:20,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 155.9s TimeCoverageRelationStatistics Valid=428, Invalid=4968, Unknown=18, NotChecked=438, Total=5852 [2024-11-28 04:54:20,072 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 54 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:20,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 729 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1714 Invalid, 0 Unknown, 196 Unchecked, 17.4s Time] [2024-11-28 04:54:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-28 04:54:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2024-11-28 04:54:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:54:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-11-28 04:54:20,076 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 47 [2024-11-28 04:54:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:20,076 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-11-28 04:54:20,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.1774193548387095) internal successors, (135), 63 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:54:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-11-28 04:54:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:54:20,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:20,077 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:20,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 04:54:20,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:20,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-28 04:54:20,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -743254080, now seen corresponding path program 2 times [2024-11-28 04:54:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:20,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779266378] [2024-11-28 04:54:20,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:54:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:20,352 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:54:20,352 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:54:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:54:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779266378] [2024-11-28 04:54:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779266378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373672769] [2024-11-28 04:54:26,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:54:26,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:26,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:26,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:26,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934f9619-3647-4a65-973f-db04b84d5eeb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:54:26,372 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:54:26,373 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:54:26,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-28 04:54:26,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:26,400 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-28 04:54:26,785 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:54:26,785 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-28 04:54:27,240 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-28 04:54:27,430 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-28 04:54:27,431 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 22 treesize of output 33 [2024-11-28 04:54:28,633 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:54:28,633 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 04:54:28,908 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2024-11-28 04:54:28,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2024-11-28 04:54:29,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-28 04:54:29,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-28 04:54:30,100 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 23 treesize of output 11 [2024-11-28 04:54:30,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 58 treesize of output 30 [2024-11-28 04:54:31,285 INFO L349 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2024-11-28 04:54:31,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 36 [2024-11-28 04:54:31,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-28 04:54:31,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 22 [2024-11-28 04:54:31,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 69 treesize of output 33 [2024-11-28 04:54:32,319 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:54:32,320 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 46 [2024-11-28 04:54:32,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:32,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 04:54:33,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:33,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 04:54:33,085 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-28 04:54:33,086 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 81 treesize of output 58 [2024-11-28 04:54:34,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:34,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-28 04:54:34,743 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:54:34,743 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 46 [2024-11-28 04:54:36,326 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:54:36,326 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 49 [2024-11-28 04:54:36,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:54:36,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-28 04:54:36,763 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:54:36,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 39 [2024-11-28 04:54:36,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:54:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:54:37,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:54:53,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1533 Int) (v_ArrVal_1529 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_ArrVal_1533)) .cse3) .cse4)) (< .cse4 0) (not (= v_ArrVal_1532 (store .cse5 .cse2 (select v_ArrVal_1532 .cse2)))) (< 0 (+ 5 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1532) .cse3) .cse4))) (= .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1529 (Array Int Int))) (let ((.cse8 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse7 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1532) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) .cse8))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse7) (< .cse8 0) (not (= v_ArrVal_1532 (store .cse5 .cse2 (select v_ArrVal_1532 .cse2)))) (< 0 (+ 5 .cse7)) (= .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse9) (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse11 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select .cse10 .cse9) .cse11)) (< .cse11 0) (not (= v_ArrVal_1532 (store .cse5 .cse2 (select v_ArrVal_1532 .cse2)))) (< 0 (+ 5 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1532) .cse9) .cse11)))))))))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse13 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse12 (select (select .cse15 .cse14) .cse13))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse12) (< .cse13 0) (not (= v_ArrVal_1532 (store .cse5 .cse2 (select v_ArrVal_1532 .cse2)))) (< (+ 7 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1532) .cse14) .cse13)) (select |c_#length| .cse12)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse14))))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1533 Int) (v_ArrVal_1529 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse17 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse16 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1532) .cse20) .cse17))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse16) (< .cse17 0) (not (= v_ArrVal_1532 (store .cse5 .cse2 (select v_ArrVal_1532 .cse2)))) (< (+ 7 .cse16) (select |c_#length| (select (select (store .cse18 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse19 .cse2 v_ArrVal_1533)) .cse20) .cse17))) (= .cse17 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse22 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse21 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1532) .cse24) .cse22))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse21) (< .cse22 0) (not (= v_ArrVal_1532 (store .cse5 .cse2 (select v_ArrVal_1532 .cse2)))) (< (+ 7 .cse21) (select |c_#length| (select (select .cse23 .cse24) .cse22))))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse24))))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1533 Int) (v_ArrVal_1529 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse26 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse25 (select (select (store .cse28 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse29 .cse2 v_ArrVal_1533)) .cse27) .cse26))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse25) (< .cse26 0) (not (= v_ArrVal_1532 (store .cse5 .cse2 (select v_ArrVal_1532 .cse2)))) (< (+ 7 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1532) .cse27) .cse26)) (select |c_#length| .cse25)) (= .cse26 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse30 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse30) (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse32 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse31 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1532) .cse30) .cse32))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse31) (< .cse32 0) (not (= v_ArrVal_1532 (store .cse5 .cse2 (select v_ArrVal_1532 .cse2)))) (< 0 (+ 5 .cse31)))))))))))) is different from false [2024-11-28 04:54:54,317 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1533 Int) (v_ArrVal_1529 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse2 0) (< 0 (+ 5 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse4) .cse2))) (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse1 v_ArrVal_1533)) .cse4) .cse2) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse8 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse10) .cse8))) (or (= .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= (store .cse0 .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse8 0) (< (+ 7 .cse7) (select |c_#length| (select (select .cse9 .cse10) .cse8))))))) (= .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1529 (Array Int Int))) (let ((.cse12 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse11 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse12))) (or (= .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= (store .cse0 .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse12 0) (< 0 (+ 5 .cse11)) (= .cse12 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1533 Int) (v_ArrVal_1529 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse13 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse17 .cse1 v_ArrVal_1533)) .cse14) .cse13))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse13 0) (= .cse13 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< (+ 7 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse14) .cse13)) (select |c_#length| .cse15)) (= .cse15 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1533 Int) (v_ArrVal_1529 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse19 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse18 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse22) .cse19))) (or (= .cse18 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= (store .cse0 .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse19 0) (= .cse19 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< (+ 7 .cse18) (select |c_#length| (select (select (store .cse20 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse21 .cse1 v_ArrVal_1533)) .cse22) .cse19))))))))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse25 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select .cse23 .cse24) .cse25)) (not (= (store .cse0 .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse25 0) (< 0 (+ 5 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse24) .cse25)))))) (= .cse24 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse27 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse26 (select (select .cse29 .cse28) .cse27))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse26) (not (= (store .cse0 .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse27 0) (< (+ 7 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse28) .cse27)) (select |c_#length| .cse26)))))) (= .cse28 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse31 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse30 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse32) .cse31))) (or (= .cse30 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= (store .cse0 .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse31 0) (< 0 (+ 5 .cse30)))))) (= .cse32 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) is different from false [2024-11-28 04:55:17,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1528 (Array Int Int))) (or (forall ((v_ArrVal_1527 (Array Int Int))) (or (not (= v_ArrVal_1527 (store .cse0 .cse1 (select v_ArrVal_1527 .cse1)))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1527) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1528))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse7 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse3) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse6) .cse7))) (or (not (= (store (select (store .cse2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse3) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< (+ 7 .cse4) (select |c_#length| (select (select .cse5 .cse6) .cse7))) (< .cse7 0) (= .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) (= .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) (not (= (store .cse8 .cse1 (select v_ArrVal_1528 .cse1)) v_ArrVal_1528)))) (forall ((v_ArrVal_1528 (Array Int Int))) (or (forall ((v_ArrVal_1527 (Array Int Int))) (or (not (= v_ArrVal_1527 (store .cse0 .cse1 (select v_ArrVal_1527 .cse1)))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1533 Int) (v_ArrVal_1529 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1527) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse12 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1528))) (let ((.cse10 (store (select .cse9 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse13 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse14 .cse1 v_ArrVal_1533)) .cse11) .cse12))) (or (not (= (store (select (store .cse9 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse10) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< (+ 7 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse10) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse11) .cse12)) (select |c_#length| .cse13)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse13) (< .cse12 0) (= .cse12 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))) (not (= (store .cse8 .cse1 (select v_ArrVal_1528 .cse1)) v_ArrVal_1528)))) (forall ((v_ArrVal_1528 (Array Int Int))) (or (not (= (store .cse8 .cse1 (select v_ArrVal_1528 .cse1)) v_ArrVal_1528)) (forall ((v_ArrVal_1527 (Array Int Int))) (or (not (= v_ArrVal_1527 (store .cse0 .cse1 (select v_ArrVal_1527 .cse1)))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1527) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1528))) (let ((.cse15 (store (select .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse17 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse15) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse16) .cse17) 5)) (not (= (store (select (store .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse15) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select .cse19 .cse16) .cse17)) (< .cse17 0))))) (= .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))))) (forall ((v_ArrVal_1528 (Array Int Int))) (or (forall ((v_ArrVal_1527 (Array Int Int))) (or (not (= v_ArrVal_1527 (store .cse0 .cse1 (select v_ArrVal_1527 .cse1)))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1533 Int) (v_ArrVal_1529 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1527) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse23 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1528))) (let ((.cse20 (store (select .cse23 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse21 (select .cse24 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse22 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse20) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse21) .cse22) 5)) (not (= (store (select (store .cse23 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse20) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse24 .cse1 v_ArrVal_1533)) .cse21) .cse22)) (< .cse22 0) (= .cse22 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (not (= (store .cse8 .cse1 (select v_ArrVal_1528 .cse1)) v_ArrVal_1528)))) (forall ((v_ArrVal_1528 (Array Int Int))) (or (forall ((v_ArrVal_1527 (Array Int Int))) (or (not (= v_ArrVal_1527 (store .cse0 .cse1 (select v_ArrVal_1527 .cse1)))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1529 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1528))) (let ((.cse27 (store (select .cse26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse28 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse27) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1527) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse28))) (or (< 0 (+ .cse25 5)) (not (= (store (select (store .cse26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse27) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse28 0) (= .cse25 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= .cse28 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))) (not (= (store .cse8 .cse1 (select v_ArrVal_1528 .cse1)) v_ArrVal_1528)))) (forall ((v_ArrVal_1528 (Array Int Int))) (or (forall ((v_ArrVal_1527 (Array Int Int))) (or (not (= v_ArrVal_1527 (store .cse0 .cse1 (select v_ArrVal_1527 .cse1)))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1527) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse29 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1528))) (let ((.cse32 (store (select .cse31 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse33 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse29) .cse33))) (or (< 0 (+ .cse30 5)) (not (= (store (select (store .cse31 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< .cse33 0) (= .cse30 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))))))) (not (= (store .cse8 .cse1 (select v_ArrVal_1528 .cse1)) v_ArrVal_1528)))) (forall ((v_ArrVal_1528 (Array Int Int))) (or (forall ((v_ArrVal_1527 (Array Int Int))) (or (not (= v_ArrVal_1527 (store .cse0 .cse1 (select v_ArrVal_1527 .cse1)))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1533 Int) (v_ArrVal_1529 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1527) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse34 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1528))) (let ((.cse35 (store (select .cse34 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse38 (select .cse37 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse39 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse35) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse38) .cse39))) (or (not (= (store (select (store .cse34 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse35) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (< (+ 7 .cse36) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse37 .cse1 v_ArrVal_1533)) .cse38) .cse39))) (< .cse39 0) (= .cse36 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= .cse39 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))) (not (= (store .cse8 .cse1 (select v_ArrVal_1528 .cse1)) v_ArrVal_1528)))) (forall ((v_ArrVal_1528 (Array Int Int))) (or (forall ((v_ArrVal_1527 (Array Int Int))) (or (not (= v_ArrVal_1527 (store .cse0 .cse1 (select v_ArrVal_1527 .cse1)))) (forall ((v_ArrVal_1529 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1527) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1529))) (let ((.cse40 (select (select .cse45 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse40 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1532 (Array Int Int))) (let ((.cse44 (select v_ArrVal_1532 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse41 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1528))) (let ((.cse42 (store (select .cse41 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse43 (select (select .cse45 .cse40) .cse44))) (or (not (= (store (select (store .cse41 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse42) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1532 .cse1)) v_ArrVal_1532)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse43) (< (+ 7 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse42) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1532) .cse40) .cse44)) (select |c_#length| .cse43)) (< .cse44 0))))))))))) (not (= (store .cse8 .cse1 (select v_ArrVal_1528 .cse1)) v_ArrVal_1528)))))) is different from false [2024-11-28 04:56:08,731 INFO L349 Elim1Store]: treesize reduction 29, result has 67.0 percent of original size [2024-11-28 04:56:08,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1208 treesize of output 1222 [2024-11-28 04:56:09,113 INFO L349 Elim1Store]: treesize reduction 26, result has 57.4 percent of original size [2024-11-28 04:56:09,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1731 treesize of output 1737 [2024-11-28 04:56:09,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1011 treesize of output 915 [2024-11-28 04:56:09,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:09,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:56:09,980 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 3 [2024-11-28 04:56:10,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:10,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:56:11,212 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 9 treesize of output 5 [2024-11-28 04:56:12,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:12,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:12,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:12,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:13,155 INFO L349 Elim1Store]: treesize reduction 12, result has 73.9 percent of original size [2024-11-28 04:56:13,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 180 [2024-11-28 04:56:13,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:13,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:13,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 04:56:19,129 INFO L349 Elim1Store]: treesize reduction 188, result has 26.3 percent of original size [2024-11-28 04:56:19,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 998 treesize of output 1000 [2024-11-28 04:56:19,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:19,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:19,571 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:19,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:19,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:19,731 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2024-11-28 04:56:19,731 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 63 treesize of output 37 [2024-11-28 04:56:19,772 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:19,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:19,778 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:19,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:19,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:19,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2024-11-28 04:56:20,279 INFO L349 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2024-11-28 04:56:20,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 18 [2024-11-28 04:56:20,562 INFO L349 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2024-11-28 04:56:20,562 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 778 treesize of output 747 [2024-11-28 04:56:21,351 INFO L349 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2024-11-28 04:56:21,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 18 [2024-11-28 04:56:21,512 INFO L349 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2024-11-28 04:56:21,513 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 2 case distinctions, treesize of input 86 treesize of output 1 [2024-11-28 04:56:21,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:21,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:56:21,926 INFO L349 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2024-11-28 04:56:21,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 18 [2024-11-28 04:56:22,223 INFO L224 Elim1Store]: Index analysis took 119 ms [2024-11-28 04:56:22,721 INFO L349 Elim1Store]: treesize reduction 188, result has 26.3 percent of original size [2024-11-28 04:56:22,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 444 treesize of output 470 [2024-11-28 04:56:23,643 INFO L349 Elim1Store]: treesize reduction 108, result has 29.4 percent of original size [2024-11-28 04:56:23,644 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 5 new quantified variables, introduced 12 case distinctions, treesize of input 145 treesize of output 155 [2024-11-28 04:56:23,858 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:23,861 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:23,864 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:23,867 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:23,893 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:56:23,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2024-11-28 04:56:24,193 INFO L224 Elim1Store]: Index analysis took 127 ms [2024-11-28 04:56:24,272 INFO L349 Elim1Store]: treesize reduction 254, result has 0.4 percent of original size [2024-11-28 04:56:24,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 1 [2024-11-28 04:56:24,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:24,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:56:24,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:24,643 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 32 treesize of output 28 [2024-11-28 04:56:24,828 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:24,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-28 04:56:24,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:24,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:25,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:25,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:25,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:25,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:25,241 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:25,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:25,475 INFO L224 Elim1Store]: Index analysis took 157 ms [2024-11-28 04:56:25,629 INFO L349 Elim1Store]: treesize reduction 178, result has 0.6 percent of original size [2024-11-28 04:56:25,630 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 4 case distinctions, treesize of input 198 treesize of output 1 [2024-11-28 04:56:25,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:25,839 INFO L224 Elim1Store]: Index analysis took 108 ms [2024-11-28 04:56:25,994 INFO L349 Elim1Store]: treesize reduction 178, result has 0.6 percent of original size [2024-11-28 04:56:25,994 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 4 case distinctions, treesize of input 198 treesize of output 1 [2024-11-28 04:56:26,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:26,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:26,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:26,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:26,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:56:26,318 INFO L349 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2024-11-28 04:56:26,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 1 [2024-11-28 04:56:26,362 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 74 treesize of output 70 [2024-11-28 04:56:26,443 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:26,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-28 04:56:26,466 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:56:26,533 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:56:26,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:26,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-28 04:56:28,368 INFO L349 Elim1Store]: treesize reduction 94, result has 32.4 percent of original size [2024-11-28 04:56:28,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 484 treesize of output 482 [2024-11-28 04:56:31,453 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:31,706 INFO L349 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2024-11-28 04:56:31,707 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 292 treesize of output 273 [2024-11-28 04:56:32,388 INFO L349 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2024-11-28 04:56:32,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 287 treesize of output 273 [2024-11-28 04:56:35,807 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:56:35,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 220 [2024-11-28 04:56:36,914 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:37,273 INFO L349 Elim1Store]: treesize reduction 29, result has 56.7 percent of original size [2024-11-28 04:56:37,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1448 treesize of output 1441 [2024-11-28 04:56:37,689 INFO L349 Elim1Store]: treesize reduction 26, result has 57.4 percent of original size [2024-11-28 04:56:37,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11203 treesize of output 11057 [2024-11-28 04:56:38,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:38,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3408 treesize of output 3054 [2024-11-28 04:56:38,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:38,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:56:38,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:38,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:56:39,745 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 336 treesize of output 284 [2024-11-28 04:56:57,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:56:57,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:56:57,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:57,671 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:56:57,816 INFO L224 Elim1Store]: Index analysis took 170 ms [2024-11-28 04:56:58,594 INFO L349 Elim1Store]: treesize reduction 299, result has 24.5 percent of original size [2024-11-28 04:56:58,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 21422 treesize of output 20604 [2024-11-28 04:57:08,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:08,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:08,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:08,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:08,357 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2024-11-28 04:57:08,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:08,854 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 260 treesize of output 272 [2024-11-28 04:57:09,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:09,463 INFO L349 Elim1Store]: treesize reduction 90, result has 30.2 percent of original size [2024-11-28 04:57:09,463 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 7 case distinctions, treesize of input 478 treesize of output 484 [2024-11-28 04:57:09,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:09,692 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:09,692 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:09,693 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:09,709 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 04:57:09,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2024-11-28 04:57:09,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:09,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:09,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:09,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:09,838 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:09,839 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2024-11-28 04:57:10,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:10,227 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:10,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:10,246 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:10,247 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2024-11-28 04:57:12,088 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:12,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-28 04:57:12,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:12,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:12,572 INFO L224 Elim1Store]: Index analysis took 153 ms [2024-11-28 04:57:13,329 INFO L349 Elim1Store]: treesize reduction 321, result has 18.9 percent of original size [2024-11-28 04:57:13,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 18971 treesize of output 18351 [2024-11-28 04:57:14,903 INFO L349 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2024-11-28 04:57:14,905 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 10665 treesize of output 10555 [2024-11-28 04:57:20,598 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:20,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 264 [2024-11-28 04:57:21,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:21,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:57:23,894 INFO L349 Elim1Store]: treesize reduction 9, result has 40.0 percent of original size [2024-11-28 04:57:23,895 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 29 [2024-11-28 04:57:24,244 INFO L349 Elim1Store]: treesize reduction 41, result has 38.8 percent of original size [2024-11-28 04:57:24,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 62 [2024-11-28 04:57:24,414 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-28 04:57:24,415 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 29 treesize of output 22 [2024-11-28 04:57:24,801 INFO L224 Elim1Store]: Index analysis took 141 ms [2024-11-28 04:57:25,444 INFO L349 Elim1Store]: treesize reduction 305, result has 18.4 percent of original size [2024-11-28 04:57:25,445 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 1563 treesize of output 1568 [2024-11-28 04:57:26,921 INFO L349 Elim1Store]: treesize reduction 26, result has 62.3 percent of original size [2024-11-28 04:57:26,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 69 treesize of output 99 [2024-11-28 04:57:27,430 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:27,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:27,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:27,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 115 [2024-11-28 04:57:29,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:29,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 259 [2024-11-28 04:57:31,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:31,943 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 381 treesize of output 367 [2024-11-28 04:57:39,707 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:39,895 INFO L349 Elim1Store]: treesize reduction 54, result has 19.4 percent of original size [2024-11-28 04:57:39,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 848 treesize of output 816 [2024-11-28 04:57:39,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:40,000 INFO L349 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2024-11-28 04:57:40,000 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 628 treesize of output 620 [2024-11-28 04:57:40,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:40,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:40,073 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 2 case distinctions, treesize of input 52 treesize of output 40 [2024-11-28 04:57:40,272 INFO L349 Elim1Store]: treesize reduction 36, result has 50.0 percent of original size [2024-11-28 04:57:40,272 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 93 [2024-11-28 04:57:40,309 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 34 treesize of output 26 [2024-11-28 04:57:40,375 INFO L349 Elim1Store]: treesize reduction 9, result has 40.0 percent of original size [2024-11-28 04:57:40,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:57:40,440 INFO L349 Elim1Store]: treesize reduction 9, result has 40.0 percent of original size [2024-11-28 04:57:40,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 25 [2024-11-28 04:57:40,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:40,975 INFO L349 Elim1Store]: treesize reduction 41, result has 38.8 percent of original size [2024-11-28 04:57:40,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 90 [2024-11-28 04:57:40,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-28 04:57:41,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:41,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2024-11-28 04:57:41,294 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-28 04:57:41,294 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 62 treesize of output 47 [2024-11-28 04:57:41,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:41,369 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 54 treesize of output 62 [2024-11-28 04:57:41,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:41,791 INFO L349 Elim1Store]: treesize reduction 41, result has 38.8 percent of original size [2024-11-28 04:57:41,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 848 treesize of output 829 [2024-11-28 04:57:41,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:41,879 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:57:41,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 305 [2024-11-28 04:57:41,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:41,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:57:42,164 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2024-11-28 04:57:42,165 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 60 [2024-11-28 04:57:42,242 INFO L349 Elim1Store]: treesize reduction 9, result has 40.0 percent of original size [2024-11-28 04:57:42,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 25 [2024-11-28 04:57:42,313 INFO L349 Elim1Store]: treesize reduction 9, result has 40.0 percent of original size [2024-11-28 04:57:42,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:57:42,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-28 04:57:42,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:42,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2024-11-28 04:57:42,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:42,871 INFO L349 Elim1Store]: treesize reduction 41, result has 38.8 percent of original size [2024-11-28 04:57:42,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 90 [2024-11-28 04:57:43,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2024-11-28 04:57:43,526 INFO L349 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2024-11-28 04:57:43,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7843 treesize of output 7652 [2024-11-28 04:57:43,629 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:43,820 INFO L349 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2024-11-28 04:57:43,821 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 36291 treesize of output 35787 [2024-11-28 04:57:44,074 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 1150 treesize of output 1118 [2024-11-28 04:57:44,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:44,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:57:44,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:44,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:57:44,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:44,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:44,905 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:44,908 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:45,172 INFO L349 Elim1Store]: treesize reduction 32, result has 67.7 percent of original size [2024-11-28 04:57:45,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 678 treesize of output 740 [2024-11-28 04:57:45,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:45,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:45,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:57:45,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 95 [2024-11-28 04:57:45,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:45,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:45,936 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:45,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:57:45,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:57:45,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-28 04:57:47,601 INFO L349 Elim1Store]: treesize reduction 164, result has 18.8 percent of original size [2024-11-28 04:57:47,602 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 9337 treesize of output 9110