./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 e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/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_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:11:42,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:11:42,130 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:11:42,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:11:42,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:11:42,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:11:42,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:11:42,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:11:42,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:11:42,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:11:42,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:11:42,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:11:42,168 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:11:42,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:11:42,169 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:11:42,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:11:42,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:11:42,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:11:42,172 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:11:42,172 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:11:42,173 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:11:42,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:11:42,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:11:42,174 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:11:42,175 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:11:42,175 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:11:42,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:11:42,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:11:42,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:11:42,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:11:42,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:11:42,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:11:42,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:11:42,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:11:42,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:11:42,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:11:42,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:11:42,180 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:11:42,180 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 [2023-11-06 22:11:42,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:11:42,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:11:42,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:11:42,453 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:11:42,454 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:11:42,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2023-11-06 22:11:45,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:11:45,813 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:11:45,813 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2023-11-06 22:11:45,840 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/data/1847b99d7/e1a0a83b5c2241398c57d5a633d8eced/FLAG6f66c7ee3 [2023-11-06 22:11:45,856 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/data/1847b99d7/e1a0a83b5c2241398c57d5a633d8eced [2023-11-06 22:11:45,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:11:45,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:11:45,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:45,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:11:45,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:11:45,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:45" (1/1) ... [2023-11-06 22:11:45,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3e86aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:45, skipping insertion in model container [2023-11-06 22:11:45,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:45" (1/1) ... [2023-11-06 22:11:45,942 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:11:46,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:46,354 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:11:46,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:46,438 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:11:46,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46 WrapperNode [2023-11-06 22:11:46,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:46,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:46,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:11:46,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:11:46,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,484 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2023-11-06 22:11:46,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:46,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:11:46,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:11:46,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:11:46,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:11:46,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:11:46,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:11:46,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:11:46,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:11:46,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:46,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:11:46,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:11:46,618 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-06 22:11:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-06 22:11:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:11:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:11:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:11:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:11:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:11:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:11:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:11:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:11:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:11:46,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:11:46,732 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:11:46,733 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:11:46,757 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-06 22:11:47,076 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:11:47,088 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:11:47,088 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:11:47,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:47 BoogieIcfgContainer [2023-11-06 22:11:47,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:11:47,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:11:47,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:11:47,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:11:47,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:11:45" (1/3) ... [2023-11-06 22:11:47,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fdf886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:47, skipping insertion in model container [2023-11-06 22:11:47,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46" (2/3) ... [2023-11-06 22:11:47,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fdf886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:47, skipping insertion in model container [2023-11-06 22:11:47,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:47" (3/3) ... [2023-11-06 22:11:47,107 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2023-11-06 22:11:47,128 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:11:47,129 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-11-06 22:11:47,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:11:47,181 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a258bfc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:11:47,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-11-06 22:11:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 64 states have internal predecessors, (74), 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) [2023-11-06 22:11:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 22:11:47,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:47,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 22:11:47,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:47,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-11-06 22:11:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:47,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865998222] [2023-11-06 22:11:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:47,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865998222] [2023-11-06 22:11:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865998222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:47,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:11:47,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838546041] [2023-11-06 22:11:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:47,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:47,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:47,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:47,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:47,508 INFO L87 Difference]: Start difference. First operand has 66 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 64 states have internal predecessors, (74), 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) [2023-11-06 22:11:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:47,640 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2023-11-06 22:11:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:47,642 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 [2023-11-06 22:11:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:47,648 INFO L225 Difference]: With dead ends: 62 [2023-11-06 22:11:47,648 INFO L226 Difference]: Without dead ends: 56 [2023-11-06 22:11:47,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:47,654 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:47,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 80 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:11:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-06 22:11:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-06 22:11:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 55 states have internal predecessors, (59), 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) [2023-11-06 22:11:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2023-11-06 22:11:47,693 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 4 [2023-11-06 22:11:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:47,693 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2023-11-06 22:11:47,694 INFO L496 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) [2023-11-06 22:11:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2023-11-06 22:11:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 22:11:47,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:47,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 22:11:47,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:11:47,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:47,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-11-06 22:11:47,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:47,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672515390] [2023-11-06 22:11:47,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:47,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672515390] [2023-11-06 22:11:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672515390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:47,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:11:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694728249] [2023-11-06 22:11:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:47,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:47,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:47,859 INFO L87 Difference]: Start difference. First operand 56 states and 59 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) [2023-11-06 22:11:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:47,916 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2023-11-06 22:11:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:47,916 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 [2023-11-06 22:11:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:47,918 INFO L225 Difference]: With dead ends: 53 [2023-11-06 22:11:47,918 INFO L226 Difference]: Without dead ends: 53 [2023-11-06 22:11:47,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:47,920 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:47,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:11:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-06 22:11:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-06 22:11:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 52 states have internal predecessors, (56), 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) [2023-11-06 22:11:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2023-11-06 22:11:47,928 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 4 [2023-11-06 22:11:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:47,928 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2023-11-06 22:11:47,929 INFO L496 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) [2023-11-06 22:11:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2023-11-06 22:11:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:11:47,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:47,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:47,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:11:47,930 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:47,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2023-11-06 22:11:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392649209] [2023-11-06 22:11:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:48,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:48,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392649209] [2023-11-06 22:11:48,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392649209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:48,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:48,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:11:48,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953892111] [2023-11-06 22:11:48,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:48,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:48,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:48,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:48,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:48,084 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:48,157 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2023-11-06 22:11:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:48,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:11:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:48,162 INFO L225 Difference]: With dead ends: 51 [2023-11-06 22:11:48,162 INFO L226 Difference]: Without dead ends: 51 [2023-11-06 22:11:48,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:48,164 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:48,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:11:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-06 22:11:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-06 22:11:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.588235294117647) 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) [2023-11-06 22:11:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2023-11-06 22:11:48,173 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 9 [2023-11-06 22:11:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:48,173 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2023-11-06 22:11:48,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2023-11-06 22:11:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:11:48,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:48,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:48,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:11:48,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:48,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2023-11-06 22:11:48,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:48,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879862844] [2023-11-06 22:11:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879862844] [2023-11-06 22:11:48,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879862844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:48,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:48,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:11:48,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367129822] [2023-11-06 22:11:48,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:48,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:48,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:48,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:48,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:48,411 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:48,456 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2023-11-06 22:11:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:48,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:11:48,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:48,458 INFO L225 Difference]: With dead ends: 49 [2023-11-06 22:11:48,458 INFO L226 Difference]: Without dead ends: 49 [2023-11-06 22:11:48,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:48,460 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 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.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:48,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:11:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-06 22:11:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-06 22:11:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 48 states have internal predecessors, (52), 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) [2023-11-06 22:11:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-11-06 22:11:48,468 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2023-11-06 22:11:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:48,468 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-11-06 22:11:48,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-11-06 22:11:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:11:48,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:48,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:48,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:11:48,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:48,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2023-11-06 22:11:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:48,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851521383] [2023-11-06 22:11:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:48,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851521383] [2023-11-06 22:11:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851521383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:48,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:48,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:11:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580261532] [2023-11-06 22:11:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:48,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:48,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:48,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:48,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:48,548 INFO L87 Difference]: Start difference. First operand 49 states and 52 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) [2023-11-06 22:11:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:48,561 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2023-11-06 22:11:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:48,561 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 [2023-11-06 22:11:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:48,562 INFO L225 Difference]: With dead ends: 54 [2023-11-06 22:11:48,562 INFO L226 Difference]: Without dead ends: 54 [2023-11-06 22:11:48,563 INFO L412 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 [2023-11-06 22:11:48,564 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 93 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 [2023-11-06 22:11:48,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:11:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-06 22:11:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-11-06 22:11:48,570 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) [2023-11-06 22:11:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-11-06 22:11:48,572 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 11 [2023-11-06 22:11:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:48,572 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-11-06 22:11:48,573 INFO L496 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) [2023-11-06 22:11:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-11-06 22:11:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:11:48,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:48,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:48,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:11:48,574 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:48,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2023-11-06 22:11:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:48,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577891241] [2023-11-06 22:11:48,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:48,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577891241] [2023-11-06 22:11:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577891241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647192320] [2023-11-06 22:11:48,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:48,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:48,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:48,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:11:48,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:11:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:48,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:11:48,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:48,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:11:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647192320] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:11:48,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:11:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-06 22:11:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169855676] [2023-11-06 22:11:48,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:11:48,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:11:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:48,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:11:48,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:11:48,955 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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) [2023-11-06 22:11:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:48,987 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2023-11-06 22:11:48,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:11:48,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 16 [2023-11-06 22:11:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:48,989 INFO L225 Difference]: With dead ends: 65 [2023-11-06 22:11:48,989 INFO L226 Difference]: Without dead ends: 65 [2023-11-06 22:11:48,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:11:48,990 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:48,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 182 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:11:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-06 22:11:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-06 22:11:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.36) internal successors, (68), 64 states have internal predecessors, (68), 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) [2023-11-06 22:11:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2023-11-06 22:11:49,000 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 16 [2023-11-06 22:11:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:49,001 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2023-11-06 22:11:49,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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) [2023-11-06 22:11:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2023-11-06 22:11:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:11:49,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:49,004 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:49,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:11:49,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:11:49,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:49,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2023-11-06 22:11:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:49,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928198817] [2023-11-06 22:11:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:49,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:11:49,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928198817] [2023-11-06 22:11:49,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928198817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:49,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:49,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:11:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455510916] [2023-11-06 22:11:49,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:49,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:11:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:11:49,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:49,442 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:49,633 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2023-11-06 22:11:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:11:49,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-06 22:11:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:49,637 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:11:49,638 INFO L226 Difference]: Without dead ends: 79 [2023-11-06 22:11:49,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:11:49,639 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 68 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:49,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 87 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:11:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-06 22:11:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2023-11-06 22:11:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 61 states have internal predecessors, (66), 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) [2023-11-06 22:11:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-11-06 22:11:49,657 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 31 [2023-11-06 22:11:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:49,658 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-11-06 22:11:49,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-11-06 22:11:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:11:49,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:49,660 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:49,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:11:49,660 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:49,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2023-11-06 22:11:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:49,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547121269] [2023-11-06 22:11:49,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:49,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:11:50,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:50,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547121269] [2023-11-06 22:11:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547121269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:50,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:11:50,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135307272] [2023-11-06 22:11:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:50,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:11:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:11:50,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:50,035 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:50,227 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2023-11-06 22:11:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:11:50,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-06 22:11:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:50,230 INFO L225 Difference]: With dead ends: 70 [2023-11-06 22:11:50,230 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 22:11:50,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:11:50,234 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:50,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 98 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:11:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 22:11:50,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2023-11-06 22:11:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 64 states have internal predecessors, (69), 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) [2023-11-06 22:11:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2023-11-06 22:11:50,247 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 31 [2023-11-06 22:11:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:50,248 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2023-11-06 22:11:50,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2023-11-06 22:11:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:11:50,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:50,250 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:50,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:11:50,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:50,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash -453751472, now seen corresponding path program 1 times [2023-11-06 22:11:50,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:50,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915533667] [2023-11-06 22:11:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:50,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:11:51,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915533667] [2023-11-06 22:11:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915533667] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144411167] [2023-11-06 22:11:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:51,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:51,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:11:51,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:11:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:51,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 22:11:51,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:51,626 INFO L351 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 [2023-11-06 22:11:51,710 INFO L351 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 [2023-11-06 22:11:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:11:51,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:11:52,102 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:52,103 INFO L351 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 44 treesize of output 34 [2023-11-06 22:11:52,134 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:52,134 INFO L351 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 47 treesize of output 49 [2023-11-06 22:11:52,191 INFO L351 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 41 treesize of output 29 [2023-11-06 22:11:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:11:52,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144411167] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:11:52,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:11:52,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-11-06 22:11:52,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244836307] [2023-11-06 22:11:52,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:11:52,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 22:11:52,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:52,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:11:52,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=507, Unknown=14, NotChecked=0, Total=600 [2023-11-06 22:11:52,379 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 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) [2023-11-06 22:11:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:52,792 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2023-11-06 22:11:52,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:11:52,792 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 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 [2023-11-06 22:11:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:52,793 INFO L225 Difference]: With dead ends: 65 [2023-11-06 22:11:52,793 INFO L226 Difference]: Without dead ends: 65 [2023-11-06 22:11:52,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=808, Unknown=14, NotChecked=0, Total=992 [2023-11-06 22:11:52,795 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:52,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 390 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:11:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-06 22:11:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-06 22:11:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 64 states have internal predecessors, (68), 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) [2023-11-06 22:11:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2023-11-06 22:11:52,798 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 35 [2023-11-06 22:11:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:52,799 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2023-11-06 22:11:52,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 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) [2023-11-06 22:11:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2023-11-06 22:11:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:11:52,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:52,806 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:52,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:11:53,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:53,017 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:53,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2023-11-06 22:11:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:53,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513208742] [2023-11-06 22:11:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:11:53,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:53,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513208742] [2023-11-06 22:11:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513208742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17079230] [2023-11-06 22:11:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:53,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:53,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:53,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:11:54,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:11:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:54,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-06 22:11:54,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:54,234 INFO L351 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 [2023-11-06 22:11:54,330 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:11:54,331 INFO L351 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 [2023-11-06 22:11:54,402 INFO L351 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 [2023-11-06 22:11:54,408 INFO L351 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 [2023-11-06 22:11:54,463 INFO L351 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 [2023-11-06 22:11:54,473 INFO L351 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 [2023-11-06 22:11:54,579 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:11:54,579 INFO L351 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 [2023-11-06 22:11:54,594 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:11:54,595 INFO L351 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 [2023-11-06 22:11:54,994 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:11:54,995 INFO L351 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 [2023-11-06 22:11:55,005 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:11:55,006 INFO L351 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 55 treesize of output 46 [2023-11-06 22:11:55,101 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:55,101 INFO L351 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 [2023-11-06 22:11:55,116 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:55,116 INFO L351 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 28 treesize of output 28 [2023-11-06 22:11:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:11:55,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:11:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:11:55,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17079230] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:11:55,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:11:55,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 33 [2023-11-06 22:11:55,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515688818] [2023-11-06 22:11:55,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:11:55,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-06 22:11:55,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:55,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-06 22:11:55,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 22:11:55,948 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 34 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) [2023-11-06 22:11:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:57,418 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-11-06 22:11:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:11:57,418 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 34 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) Word has length 37 [2023-11-06 22:11:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:57,420 INFO L225 Difference]: With dead ends: 117 [2023-11-06 22:11:57,420 INFO L226 Difference]: Without dead ends: 117 [2023-11-06 22:11:57,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=300, Invalid=1956, Unknown=0, NotChecked=0, Total=2256 [2023-11-06 22:11:57,422 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 168 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:57,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 270 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:11:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-06 22:11:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 74. [2023-11-06 22:11:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 73 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) [2023-11-06 22:11:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-11-06 22:11:57,427 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 37 [2023-11-06 22:11:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:57,427 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-11-06 22:11:57,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 34 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) [2023-11-06 22:11:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-11-06 22:11:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:11:57,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:57,429 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:57,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:11:57,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:11:57,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:11:57,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:57,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2023-11-06 22:11:57,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989122246] [2023-11-06 22:11:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:57,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:11:58,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989122246] [2023-11-06 22:11:58,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989122246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:11:58,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834416047] [2023-11-06 22:11:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:58,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:58,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:58,970 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:11:58,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:11:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:59,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-06 22:11:59,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:59,181 INFO L351 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 [2023-11-06 22:11:59,282 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:11:59,282 INFO L351 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 [2023-11-06 22:11:59,355 INFO L351 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 [2023-11-06 22:11:59,361 INFO L351 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 [2023-11-06 22:11:59,416 INFO L351 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 [2023-11-06 22:11:59,426 INFO L351 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 [2023-11-06 22:11:59,563 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:11:59,563 INFO L351 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 [2023-11-06 22:11:59,578 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:11:59,578 INFO L351 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 [2023-11-06 22:11:59,926 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:11:59,930 INFO L351 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 [2023-11-06 22:11:59,939 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:11:59,940 INFO L351 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 55 treesize of output 46 [2023-11-06 22:11:59,992 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:59,992 INFO L351 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 [2023-11-06 22:12:00,008 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:00,009 INFO L351 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 28 treesize of output 28 [2023-11-06 22:12:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:12:00,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:12:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834416047] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:01,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:01,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2023-11-06 22:12:01,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467366257] [2023-11-06 22:12:01,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:01,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 22:12:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:01,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:12:01,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:12:01,322 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 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) [2023-11-06 22:12:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:03,621 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2023-11-06 22:12:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:12:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 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 37 [2023-11-06 22:12:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:03,623 INFO L225 Difference]: With dead ends: 144 [2023-11-06 22:12:03,624 INFO L226 Difference]: Without dead ends: 144 [2023-11-06 22:12:03,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=379, Invalid=2591, Unknown=0, NotChecked=0, Total=2970 [2023-11-06 22:12:03,626 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 357 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:03,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 389 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:12:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-06 22:12:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 76. [2023-11-06 22:12:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 75 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) [2023-11-06 22:12:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-11-06 22:12:03,633 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 37 [2023-11-06 22:12:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:03,634 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-11-06 22:12:03,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 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) [2023-11-06 22:12:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-11-06 22:12:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:12:03,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:03,635 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:03,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:03,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:12:03,835 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:12:03,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1642838496, now seen corresponding path program 1 times [2023-11-06 22:12:03,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541007708] [2023-11-06 22:12:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:12:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541007708] [2023-11-06 22:12:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541007708] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939761982] [2023-11-06 22:12:05,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:05,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:05,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:05,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:12:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:05,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-06 22:12:05,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:06,087 INFO L351 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 [2023-11-06 22:12:06,255 INFO L351 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 [2023-11-06 22:12:06,273 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:12:06,274 INFO L351 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 [2023-11-06 22:12:06,286 INFO L351 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 [2023-11-06 22:12:06,372 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:12:06,372 INFO L351 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 [2023-11-06 22:12:06,376 INFO L351 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 46 treesize of output 26 [2023-11-06 22:12:06,390 INFO L351 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 [2023-11-06 22:12:06,542 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:12:06,543 INFO L351 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 [2023-11-06 22:12:06,563 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:12:06,563 INFO L351 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 [2023-11-06 22:12:06,570 INFO L351 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 [2023-11-06 22:12:07,005 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:07,005 INFO L351 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 [2023-11-06 22:12:07,017 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:07,018 INFO L351 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 57 treesize of output 48 [2023-11-06 22:12:07,036 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:12:07,037 INFO L351 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 [2023-11-06 22:12:07,172 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:07,172 INFO L351 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 [2023-11-06 22:12:07,183 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:07,183 INFO L351 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 [2023-11-06 22:12:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:12:07,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:07,973 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_963) .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (not (= v_ArrVal_960 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))))))) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_963) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse1 4))) (not (= v_ArrVal_960 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-06 22:12:08,038 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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|)) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_960 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_960 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) is different from false [2023-11-06 22:12:08,551 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:08,551 INFO L351 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 333 treesize of output 335 [2023-11-06 22:12:09,738 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:09,739 INFO L351 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 276 treesize of output 280 [2023-11-06 22:12:09,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:12:09,853 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse2 (not .cse4)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse0)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1)) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26)))) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_24 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1)) (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 .cse1)) (= (select .cse3 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_29 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_29 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_29)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_29) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_27 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (or (and (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (not (= v_ArrVal_960 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (not (= v_ArrVal_960 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse4)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_32) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_30) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_32 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_31) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_32 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse5 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1)) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26))))) .cse4) (or (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse6 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1)) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26))))) .cse4) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_18 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse0))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_18 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse8 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse1))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_21 (Array Int Int))) (or (= (select v_prenex_21 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_18 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse1))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse4) (or .cse4 (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (not (= v_ArrVal_960 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (or (and (forall ((v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse10 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1))))) (forall ((v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse11 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse12 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse0)) (= (select .cse12 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1))))) (forall ((v_prenex_21 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((v_prenex_21 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_21 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_18 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse13 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse13 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse0))))) (forall ((v_prenex_18 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse14 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse14 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 .cse1))))) (forall ((v_prenex_18 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse15 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse15 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 .cse1)))))) .cse4) (or (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse16 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26))))) .cse4)))) is different from false [2023-11-06 22:12:10,882 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (let ((.cse3 (not .cse2)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse0 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26))))) .cse2) (or .cse2 (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (not (= v_ArrVal_960 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (or .cse3 (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_26 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_prenex_26 0))))))) (or (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse4 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26))))) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_32) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_30) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_32 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_31) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_32 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or .cse2 (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse5 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1)) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse5 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26)))))) (or (and (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (not (= v_ArrVal_960 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (not (= v_ArrVal_960 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_24 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1)) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse6 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26))))))))) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_29 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (or (not (= v_prenex_29 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_prenex_29 0)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_29) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_27 4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse3) (or (and (forall ((v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse7 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse1)) (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_21 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_18 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse8 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= (select .cse8 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 4))))) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse9 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_21 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_21 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_18 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse10 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 4))))) (forall ((v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse11 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_18 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse12 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select .cse12 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 4)))))) .cse2) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_18 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= (select .cse13 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_21 (Array Int Int))) (or (= (select v_prenex_21 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_18 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse14 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 4))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_18 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= (select .cse15 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 4))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse2)))) is different from false [2023-11-06 22:12:11,408 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (let ((.cse9 (not .cse1)) (.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (and (forall ((v_ArrVal_963 (Array Int Int)) (v_subst_25 Int) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_25) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) v_subst_25 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_960 (store (select (store |c_#memory_int| v_subst_25 v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (or (forall ((v_subst_26 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (or (not (= v_ArrVal_960 (store (select (store |c_#memory_int| v_subst_26 v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) v_subst_26 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0)))) .cse1)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (or (and (forall ((v_subst_15 Int) (v_prenex_24 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| v_subst_15 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse2 4)) (= (select .cse2 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse0)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_15)))) (forall ((v_subst_14 Int) (v_prenex_24 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| v_subst_14 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_14)))) (forall ((v_prenex_21 (Array Int Int)) (v_subst_10 Int)) (or (= (select v_prenex_21 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_10) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| v_subst_10 v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0)))) (forall ((v_prenex_24 (Array Int Int)) (v_subst_11 Int)) (let ((.cse4 (select (store |c_#memory_int| v_subst_11 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse4 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_11)))) (forall ((v_subst_13 Int) (v_prenex_21 (Array Int Int))) (or (= (select (select (store |c_#memory_int| v_subst_13 v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_13))) (forall ((v_subst_7 Int) (v_prenex_18 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| v_subst_7 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_7) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4))))) (forall ((v_ArrVal_963 (Array Int Int)) (v_subst_8 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_8) (= (select (select (store |c_#memory_int| v_subst_8 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_subst_9 Int) (v_prenex_18 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| v_subst_9 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_9) (= (select .cse6 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse6 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse0))))) (forall ((v_subst_12 Int) (v_prenex_18 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| v_subst_12 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_12) (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse1) (forall ((v_subst_5 Int)) (or (forall ((v_prenex_24 (Array Int Int))) (or (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_5 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5) (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| v_subst_5 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26))))) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse0)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5))) (forall ((v_subst_27 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_27) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_27) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_32) v_subst_27 v_prenex_30) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| v_subst_27 v_prenex_31) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_32 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_32)))))))) (or .cse9 (forall ((v_subst_17 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (not (= (store (select (store |c_#memory_int| v_subst_17 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_prenex_26 0)) v_prenex_26)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_17 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_17) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse0))))) (or .cse1 (forall ((v_subst_28 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_28 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (not (= v_prenex_26 (store (select (store |c_#memory_int| v_subst_28 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_28) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 4)) (= (select .cse10 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse1 (forall ((v_prenex_25 (Array Int Int)) (v_subst_6 Int) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_6 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_6) (= (select .cse11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_26 (store (select (store |c_#memory_int| v_subst_6 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select .cse11 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse9 (forall ((v_subst_18 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (or (= (select v_prenex_27 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_18) (not (= (store (select (store |c_#memory_int| v_subst_18 v_prenex_28) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_prenex_29 0)) v_prenex_29)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_18) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_29) v_subst_18 v_prenex_27) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse1 (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_subst_16 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) v_subst_16 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0)) (not (= v_ArrVal_960 (store (select (store |c_#memory_int| v_subst_16 v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_16)))) (or (forall ((v_subst_19 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_19 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse12 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_19) (= (select .cse12 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse0)) (not (= v_prenex_26 (store (select (store |c_#memory_int| v_subst_19 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))))))) .cse1) (or (and (forall ((v_subst_23 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_23) (forall ((v_prenex_18 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| v_subst_23 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse13 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse0))))))) (forall ((v_subst_22 Int)) (or (forall ((v_prenex_21 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| v_subst_22 v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0)) (= (select v_prenex_21 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22))) (forall ((v_subst_24 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_24) (forall ((v_prenex_18 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| v_subst_24 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= (select .cse14 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_subst_21 Int)) (or (forall ((v_prenex_18 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| v_subst_21 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 .cse0)) (= (select .cse15 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_21))) (forall ((v_subst_20 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_20) (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store |c_#memory_int| v_subst_20 v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse1)))) is different from false [2023-11-06 22:12:11,587 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:11,587 INFO L351 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 50 treesize of output 40 [2023-11-06 22:12:11,590 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:12:11,597 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:11,598 INFO L351 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 68 [2023-11-06 22:12:11,614 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:11,614 INFO L351 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 1 case distinctions, treesize of input 28 treesize of output 32 [2023-11-06 22:12:11,638 INFO L351 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 8 treesize of output 6 [2023-11-06 22:12:11,672 INFO L351 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 41 treesize of output 29 [2023-11-06 22:12:11,687 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,688 INFO L351 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 73 treesize of output 1 [2023-11-06 22:12:11,698 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:11,699 INFO L351 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 50 treesize of output 40 [2023-11-06 22:12:11,703 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:12:11,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:12:11,713 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:11,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 47 treesize of output 49 [2023-11-06 22:12:11,722 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:11,723 INFO L351 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 13 treesize of output 15 [2023-11-06 22:12:11,760 INFO L351 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 41 treesize of output 29 [2023-11-06 22:12:11,775 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,776 INFO L351 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 50 treesize of output 1 [2023-11-06 22:12:11,786 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,786 INFO L351 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 73 treesize of output 1 [2023-11-06 22:12:11,797 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,798 INFO L351 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 73 treesize of output 1 [2023-11-06 22:12:11,814 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,814 INFO L351 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 [2023-11-06 22:12:11,822 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,823 INFO L351 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 1 [2023-11-06 22:12:11,850 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,850 INFO L351 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 [2023-11-06 22:12:11,858 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,859 INFO L351 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 1 [2023-11-06 22:12:11,867 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,868 INFO L351 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 [2023-11-06 22:12:11,876 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:12:11,877 INFO L351 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 50 treesize of output 1 [2023-11-06 22:12:11,886 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:11,887 INFO L351 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 50 treesize of output 40 [2023-11-06 22:12:11,890 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:12:11,904 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:12:11,905 INFO L351 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 78 [2023-11-06 22:12:11,912 INFO L351 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 21 treesize of output 13 [2023-11-06 22:12:11,918 INFO L351 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 11 treesize of output 7 [2023-11-06 22:12:11,935 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:11,936 INFO L351 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 44 treesize of output 1 [2023-11-06 22:12:11,949 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:11,950 INFO L351 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 18 treesize of output 1 [2023-11-06 22:12:11,957 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:11,957 INFO L351 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 18 treesize of output 1 [2023-11-06 22:12:11,973 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:11,974 INFO L351 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 18 treesize of output 1 [2023-11-06 22:12:11,982 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:11,982 INFO L351 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 18 treesize of output 1 [2023-11-06 22:12:11,989 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:11,990 INFO L351 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 18 treesize of output 1 [2023-11-06 22:12:11,998 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:12,003 INFO L351 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 18 treesize of output 1 [2023-11-06 22:12:12,012 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:12,012 INFO L351 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 18 treesize of output 1 [2023-11-06 22:12:12,023 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:12,024 INFO L351 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 18 treesize of output 1 [2023-11-06 22:12:12,033 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:12,035 INFO L351 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 18 treesize of output 1 [2023-11-06 22:12:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 18 not checked. [2023-11-06 22:12:12,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939761982] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:12,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:12,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 48 [2023-11-06 22:12:12,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391430566] [2023-11-06 22:12:12,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:12,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-06 22:12:12,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:12,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-06 22:12:12,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1674, Unknown=11, NotChecked=430, Total=2256 [2023-11-06 22:12:12,236 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 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) [2023-11-06 22:12:17,359 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (let ((.cse23 (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0)) (.cse18 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse20 (select (select |c_#memory_int| .cse19) 4))) (let ((.cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0) 0)) (.cse0 (= .cse20 1)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse19)) (.cse21 (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (.cse24 (not .cse4)) (.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4)) (.cse10 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse2 (not .cse18)) (.cse29 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse8 (select (select |c_#memory_int| .cse9) 4)) (.cse7 (= .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse30 (= |c_ULTIMATE.start_main_~data_init~0#1| .cse23))) (and (or (and .cse0 (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) 0)))) .cse1) .cse2 (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (or (and (forall ((v_ArrVal_963 (Array Int Int)) (v_subst_25 Int) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_25) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) v_subst_25 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_960 (store (select (store |c_#memory_int| v_subst_25 v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (or (forall ((v_subst_26 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (or (not (= v_ArrVal_960 (store (select (store |c_#memory_int| v_subst_26 v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) v_subst_26 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3)))) .cse4)) .cse5) (or (and .cse6 (or .cse7 (and (= |c_ULTIMATE.start_main_~data_init~0#1| .cse8) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse9))))) .cse10) (or (and (forall ((v_subst_15 Int) (v_prenex_24 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| v_subst_15 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 4)) (= (select .cse11 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse3)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_15)))) (forall ((v_subst_14 Int) (v_prenex_24 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| v_subst_14 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse12 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_14)))) (forall ((v_prenex_21 (Array Int Int)) (v_subst_10 Int)) (or (= (select v_prenex_21 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_10) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| v_subst_10 v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3)))) (forall ((v_prenex_24 (Array Int Int)) (v_subst_11 Int)) (let ((.cse13 (select (store |c_#memory_int| v_subst_11 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse13 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_11)))) (forall ((v_subst_13 Int) (v_prenex_21 (Array Int Int))) (or (= (select (select (store |c_#memory_int| v_subst_13 v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_13))) (forall ((v_subst_7 Int) (v_prenex_18 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| v_subst_7 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_7) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4))))) (forall ((v_ArrVal_963 (Array Int Int)) (v_subst_8 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_8) (= (select (select (store |c_#memory_int| v_subst_8 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_subst_9 Int) (v_prenex_18 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| v_subst_9 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_9) (= (select .cse15 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse15 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse3))))) (forall ((v_subst_12 Int) (v_prenex_18 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| v_subst_12 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_12) (= (select .cse16 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4) (forall ((v_subst_5 Int)) (or (forall ((v_prenex_24 (Array Int Int))) (or (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_5 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5) (= (select .cse17 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse17 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| v_subst_5 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_26))))) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse3)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5))) (not .cse10) (or .cse18 (and (or (and (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse19)) (= |c_ULTIMATE.start_main_~data_init~0#1| .cse20)) .cse1) .cse21)) (= .cse22 |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_subst_27 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_27) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_27) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_32) v_subst_27 v_prenex_30) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| v_subst_27 v_prenex_31) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_32 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_32)))))))) (= .cse23 1) (or .cse24 (forall ((v_subst_17 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (not (= (store (select (store |c_#memory_int| v_subst_17 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_prenex_26 0)) v_prenex_26)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_17 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_17) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse3))))) (or .cse4 (forall ((v_subst_28 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_28 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (not (= v_prenex_26 (store (select (store |c_#memory_int| v_subst_28 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_28) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse25 4)) (= (select .cse25 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6 (or .cse0 .cse1) .cse21 (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (or .cse4 (forall ((v_prenex_25 (Array Int Int)) (v_subst_6 Int) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_6 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_6) (= (select .cse26 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_26 (store (select (store |c_#memory_int| v_subst_6 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select .cse26 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse27 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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|)) (+ .cse27 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_960 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse27 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (or .cse24 (forall ((v_subst_18 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (or (= (select v_prenex_27 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_18) (not (= (store (select (store |c_#memory_int| v_subst_18 v_prenex_28) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_prenex_29 0)) v_prenex_29)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_18) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_29) v_subst_18 v_prenex_27) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (or .cse4 (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_subst_16 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) v_subst_16 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3)) (not (= v_ArrVal_960 (store (select (store |c_#memory_int| v_subst_16 v_ArrVal_955) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_16)))) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) .cse4 (or (forall ((v_subst_19 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_26) v_subst_19 v_prenex_24) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse28 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_24 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_19) (= (select .cse28 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_24 .cse3)) (not (= v_prenex_26 (store (select (store |c_#memory_int| v_subst_19 v_prenex_25) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))))))) .cse4) .cse29 (= .cse22 1) (or .cse10 (and (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (and .cse2 .cse30)) .cse29)) .cse5 (or (and (forall ((v_subst_23 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_23) (forall ((v_prenex_18 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| v_subst_23 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse31 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 .cse3))))))) (forall ((v_subst_22 Int)) (or (forall ((v_prenex_21 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| v_subst_22 v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3)) (= (select v_prenex_21 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22))) (forall ((v_subst_24 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_24) (forall ((v_prenex_18 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| v_subst_24 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse32 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_18 4)) (= (select .cse32 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_subst_21 Int)) (or (forall ((v_prenex_18 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| v_subst_21 v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse33 .cse3)) (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_21))) (forall ((v_subst_20 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_20) (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store |c_#memory_int| v_subst_20 v_prenex_21) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) .cse34) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.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|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_960 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_960 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse34 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (or (= .cse8 1) .cse7) .cse30)))) is different from true [2023-11-06 22:12:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:18,686 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2023-11-06 22:12:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:12:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 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 [2023-11-06 22:12:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:18,689 INFO L225 Difference]: With dead ends: 99 [2023-11-06 22:12:18,689 INFO L226 Difference]: Without dead ends: 99 [2023-11-06 22:12:18,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=407, Invalid=3145, Unknown=12, NotChecked=726, Total=4290 [2023-11-06 22:12:18,694 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 68 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 374 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:18,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 512 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1111 Invalid, 0 Unknown, 374 Unchecked, 1.3s Time] [2023-11-06 22:12:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-06 22:12:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2023-11-06 22:12:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 75 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) [2023-11-06 22:12:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-11-06 22:12:18,702 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 41 [2023-11-06 22:12:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:18,702 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-11-06 22:12:18,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 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) [2023-11-06 22:12:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-11-06 22:12:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:12:18,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:18,708 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:18,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:18,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:12:18,916 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:12:18,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1679000631, now seen corresponding path program 1 times [2023-11-06 22:12:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:18,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529595209] [2023-11-06 22:12:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:12:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529595209] [2023-11-06 22:12:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529595209] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:19,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709862605] [2023-11-06 22:12:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:19,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:19,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:19,696 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:19,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:12:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:19,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-06 22:12:19,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:19,915 INFO L351 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 [2023-11-06 22:12:19,975 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:12:19,976 INFO L351 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 [2023-11-06 22:12:20,017 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:12:20,018 INFO L351 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 [2023-11-06 22:12:20,054 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:12:20,055 INFO L351 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 [2023-11-06 22:12:20,156 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-06 22:12:20,156 INFO L351 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 16 treesize of output 18 [2023-11-06 22:12:20,209 INFO L351 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 [2023-11-06 22:12:20,269 INFO L351 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 24 treesize of output 12 [2023-11-06 22:12:20,333 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-11-06 22:12:20,521 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:20,522 INFO L351 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 39 treesize of output 25 [2023-11-06 22:12:20,581 INFO L322 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-11-06 22:12:20,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 21 [2023-11-06 22:12:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:12:20,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:20,996 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1133 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |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.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|)) (not (= (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1133 .cse1))) v_ArrVal_1133)))) is different from false [2023-11-06 22:12:21,010 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:21,011 INFO L351 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 81 treesize of output 85 [2023-11-06 22:12:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2023-11-06 22:12:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709862605] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:21,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:21,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 33 [2023-11-06 22:12:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012267656] [2023-11-06 22:12:21,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:21,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 22:12:21,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:21,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 22:12:21,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=881, Unknown=1, NotChecked=60, Total=1056 [2023-11-06 22:12:21,402 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 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) [2023-11-06 22:12:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:22,145 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2023-11-06 22:12:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:12:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 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 42 [2023-11-06 22:12:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:22,146 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:12:22,146 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 22:12:22,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=275, Invalid=1450, Unknown=1, NotChecked=80, Total=1806 [2023-11-06 22:12:22,148 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 50 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:22,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 492 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 445 Invalid, 0 Unknown, 31 Unchecked, 0.4s Time] [2023-11-06 22:12:22,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 22:12:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2023-11-06 22:12:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 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) [2023-11-06 22:12:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2023-11-06 22:12:22,152 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 42 [2023-11-06 22:12:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:22,153 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2023-11-06 22:12:22,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 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) [2023-11-06 22:12:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2023-11-06 22:12:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:12:22,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:22,154 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:22,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:22,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:12:22,366 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-11-06 22:12:22,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2023-11-06 22:12:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:22,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671794234] [2023-11-06 22:12:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:12:24,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:24,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671794234] [2023-11-06 22:12:24,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671794234] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:24,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657144644] [2023-11-06 22:12:24,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:12:24,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:24,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:24,572 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:24,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ddc0f4f-2a04-49e4-a1c2-aff27eb11429/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:12:24,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:12:24,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:12:24,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-06 22:12:24,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:24,845 INFO L351 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 [2023-11-06 22:12:24,969 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:12:24,970 INFO L351 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 [2023-11-06 22:12:25,047 INFO L351 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 [2023-11-06 22:12:25,055 INFO L351 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 [2023-11-06 22:12:25,126 INFO L351 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 [2023-11-06 22:12:25,136 INFO L351 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 [2023-11-06 22:12:25,243 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:12:25,243 INFO L351 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 26 treesize of output 29 [2023-11-06 22:12:25,360 INFO L322 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-06 22:12:25,360 INFO L351 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 56 treesize of output 36 [2023-11-06 22:12:25,390 INFO L322 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-06 22:12:25,391 INFO L351 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 23 treesize of output 22 [2023-11-06 22:12:25,477 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:12:25,477 INFO L351 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 67 treesize of output 37 [2023-11-06 22:12:25,489 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 22:12:25,490 INFO L351 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 34 treesize of output 25 [2023-11-06 22:12:25,660 INFO L322 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-11-06 22:12:25,660 INFO L351 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 63 treesize of output 60 [2023-11-06 22:12:25,687 INFO L322 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-06 22:12:25,687 INFO L351 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:12:26,653 INFO L322 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-11-06 22:12:26,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 170 treesize of output 121 [2023-11-06 22:12:26,665 INFO L322 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-11-06 22:12:26,666 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 177 treesize of output 153 [2023-11-06 22:12:27,865 INFO L322 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-06 22:12:27,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 127 treesize of output 91 [2023-11-06 22:12:27,886 INFO L322 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-06 22:12:27,886 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 108 [2023-11-06 22:12:28,136 INFO L322 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-11-06 22:12:28,136 INFO L351 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 119 [2023-11-06 22:12:28,171 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:12:28,171 INFO L351 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 71 treesize of output 83 [2023-11-06 22:12:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:12:28,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:06,327 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse10 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1318 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1319 Int) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1316 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1318))) (or (not (= v_ArrVal_1324 (store (store (select .cse0 |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_1324 4)))) (forall ((v_ArrVal_1323 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse6 (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1316)))) (store .cse8 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (store (select .cse8 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1323))))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |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))) (or (forall ((v_ArrVal_1328 (Array Int Int))) (let ((.cse4 (store .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1324))) (let ((.cse5 (store (select .cse4 |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|)) (.cse3 (select v_ArrVal_1328 0))) (let ((.cse2 (select (select (store (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse5) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1328) .cse3) .cse6)) (.cse1 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1319))) (or (= (select .cse1 .cse2) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| .cse2) (not (= (select .cse1 .cse3) 1)) (not (= v_ArrVal_1328 (store (select (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse5) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1328 4))))))))) (= .cse6 0))))))) (not (= v_ArrVal_1318 (store .cse11 .cse10 (select v_ArrVal_1318 .cse10)))))) (forall ((v_ArrVal_1318 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1319 Int) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1316 Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1318))) (or (not (= v_ArrVal_1324 (store (store (select .cse12 |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_1324 4)))) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1323 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse20 (store .cse12 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1324))) (let ((.cse14 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1319)) (.cse13 (select v_ArrVal_1328 0)) (.cse15 (store (select .cse20 |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|))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| .cse13) (not (= (select .cse14 .cse13) 1)) (forall ((v_ArrVal_1329 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1316)))) (let ((.cse17 (store .cse19 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (store (select .cse19 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1323)))) (let ((.cse18 (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse16 (select v_ArrVal_1329 0))) (or (= (select .cse14 (select (select (store (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse15) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1328) .cse13) .cse16)) 1) (not (= v_ArrVal_1329 (store (select (store .cse17 |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_1329 4)))) (= (select (select (store (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse18) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1329) .cse13) .cse16) 0)))))) (not (= v_ArrVal_1328 (store (select (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse15) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1328 4))))))))))) (not (= v_ArrVal_1318 (store .cse11 .cse10 (select v_ArrVal_1318 .cse10)))))) (forall ((v_ArrVal_1318 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1319 Int) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1316 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1318))) (or (not (= v_ArrVal_1324 (store (store (select .cse21 |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_1324 4)))) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1323 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse29 (store .cse21 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1324))) (let ((.cse22 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1319)) (.cse23 (select v_ArrVal_1328 0)) (.cse25 (store (select .cse29 |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|))) (or (not (= (select .cse22 .cse23) 1)) (forall ((v_ArrVal_1329 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1316)))) (let ((.cse26 (store .cse28 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (store (select .cse28 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1323)))) (let ((.cse27 (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse24 (select v_ArrVal_1329 0))) (or (= .cse24 0) (= (select .cse22 (select (select (store (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse25) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1328) .cse23) .cse24)) 1) (not (= v_ArrVal_1329 (store (select (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse27) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1329 4)))) (= (select (select (store (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse27) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1329) .cse23) .cse24) 0)))))) (not (= v_ArrVal_1328 (store (select (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse25) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1328 4))))))))))) (not (= v_ArrVal_1318 (store .cse11 .cse10 (select v_ArrVal_1318 .cse10)))))) (forall ((v_ArrVal_1318 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1319 Int) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1316 Int)) (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1318))) (or (not (= v_ArrVal_1324 (store (store (select .cse30 |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_1324 4)))) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1323 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse34 (store .cse30 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1324))) (let ((.cse35 (store (select .cse34 |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|)) (.cse33 (select v_ArrVal_1328 0))) (let ((.cse32 (select (select (store (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse35) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1328) .cse33) (select (select (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1316)))) (store .cse37 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (store (select .cse37 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1323))))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |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))) (.cse31 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1319))) (or (= (select .cse31 .cse32) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| .cse33) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| .cse32) (not (= (select .cse31 .cse33) 1)) (not (= v_ArrVal_1328 (store (select (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse35) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1328 4)))))))))))) (not (= v_ArrVal_1318 (store .cse11 .cse10 (select v_ArrVal_1318 .cse10)))))))) is different from false [2023-11-06 22:13:06,443 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:06,626 INFO L322 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-11-06 22:13:06,627 INFO L351 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 834 treesize of output 834 [2023-11-06 22:13:06,697 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:07,195 INFO L322 Elim1Store]: treesize reduction 84, result has 58.2 percent of original size [2023-11-06 22:13:07,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 166 treesize of output 202 [2023-11-06 22:13:07,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:07,368 INFO L217 Elim1Store]: Index analysis took 110 ms [2023-11-06 22:13:07,503 INFO L322 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2023-11-06 22:13:07,504 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 124 treesize of output 109 [2023-11-06 22:13:07,567 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:07,584 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:07,594 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:07,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:07,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:07,658 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:07,659 INFO L351 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 189 treesize of output 187 [2023-11-06 22:13:07,828 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:07,828 INFO L351 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 121 treesize of output 129 [2023-11-06 22:13:07,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:07,925 INFO L351 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 127 treesize of output 113 [2023-11-06 22:13:08,159 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:08,159 INFO L351 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 [2023-11-06 22:13:08,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:08,293 INFO L351 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 45 treesize of output 35 [2023-11-06 22:13:08,413 INFO L351 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 6 treesize of output 4 [2023-11-06 22:13:08,499 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:08,499 INFO L351 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 17 treesize of output 21 [2023-11-06 22:13:08,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:08,901 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:08,902 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:08,903 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:08,906 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:13:08,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:08,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:08,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:09,109 INFO L322 Elim1Store]: treesize reduction 36, result has 50.0 percent of original size [2023-11-06 22:13:09,110 INFO L351 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 163 treesize of output 186 [2023-11-06 22:13:09,202 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:09,202 INFO L351 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 36 treesize of output 48 [2023-11-06 22:13:09,477 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:09,477 INFO L351 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 36 treesize of output 54 [2023-11-06 22:13:09,703 INFO L351 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 116 treesize of output 102 [2023-11-06 22:13:10,263 INFO L322 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2023-11-06 22:13:10,264 INFO L351 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 2666 treesize of output 2642 [2023-11-06 22:13:11,163 INFO L322 Elim1Store]: treesize reduction 327, result has 32.9 percent of original size [2023-11-06 22:13:11,163 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 166 treesize of output 245 [2023-11-06 22:13:11,439 INFO L217 Elim1Store]: Index analysis took 155 ms [2023-11-06 22:13:11,626 INFO L322 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2023-11-06 22:13:11,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 159 treesize of output 136 [2023-11-06 22:13:11,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:11,795 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:11,795 INFO L351 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 403 treesize of output 405 [2023-11-06 22:13:12,127 INFO L351 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 6 treesize of output 4 [2023-11-06 22:13:12,331 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:12,331 INFO L351 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 [2023-11-06 22:13:12,420 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2023-11-06 22:13:12,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:12,829 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:12,829 INFO L351 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 41 treesize of output 51 [2023-11-06 22:13:13,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:13,015 INFO L351 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 19 treesize of output 13 [2023-11-06 22:13:15,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:15,897 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:15,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,209 INFO L322 Elim1Store]: treesize reduction 114, result has 44.4 percent of original size [2023-11-06 22:13:16,209 INFO L351 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 167 treesize of output 290 [2023-11-06 22:13:16,296 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,310 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,405 INFO L217 Elim1Store]: Index analysis took 122 ms [2023-11-06 22:13:16,435 INFO L322 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2023-11-06 22:13:16,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 48 [2023-11-06 22:13:16,594 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,605 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,605 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,688 INFO L217 Elim1Store]: Index analysis took 106 ms [2023-11-06 22:13:16,717 INFO L322 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2023-11-06 22:13:16,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 48 [2023-11-06 22:13:16,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:16,890 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-06 22:13:16,891 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 48 [2023-11-06 22:13:17,347 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:17,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:17,358 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:17,370 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:17,415 INFO L322 Elim1Store]: treesize reduction 11, result has 47.6 percent of original size [2023-11-06 22:13:17,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 120 [2023-11-06 22:13:17,525 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:17,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:17,615 INFO L322 Elim1Store]: treesize reduction 43, result has 18.9 percent of original size [2023-11-06 22:13:17,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 40 [2023-11-06 22:13:17,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:17,955 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:17,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:18,188 INFO L322 Elim1Store]: treesize reduction 75, result has 53.1 percent of original size [2023-11-06 22:13:18,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 147 treesize of output 225 [2023-11-06 22:13:18,224 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:18,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:18,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:18,317 INFO L322 Elim1Store]: treesize reduction 33, result has 23.3 percent of original size [2023-11-06 22:13:18,317 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 44 [2023-11-06 22:13:18,510 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:18,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:18,664 INFO L322 Elim1Store]: treesize reduction 70, result has 24.7 percent of original size [2023-11-06 22:13:18,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 56 [2023-11-06 22:13:18,894 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:18,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:18,905 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:13:18,905 INFO L351 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 42 treesize of output 30 [2023-11-06 22:13:18,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:19,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:19,034 INFO L322 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2023-11-06 22:13:19,034 INFO L351 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 1 case distinctions, treesize of input 70 treesize of output 1 [2023-11-06 22:13:19,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:19,064 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:19,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:19,368 INFO L322 Elim1Store]: treesize reduction 126, result has 38.5 percent of original size [2023-11-06 22:13:19,368 INFO L351 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 322 treesize of output 413 [2023-11-06 22:13:19,584 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:19,584 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:19,589 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:19,590 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:19,671 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-06 22:13:19,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 48 [2023-11-06 22:13:20,412 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,412 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,422 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,536 INFO L322 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2023-11-06 22:13:20,536 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 [2023-11-06 22:13:20,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:20,636 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,674 INFO L322 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-06 22:13:20,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 1 [2023-11-06 22:13:20,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:20,726 INFO L322 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2023-11-06 22:13:20,726 INFO L351 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 37 treesize of output 1 [2023-11-06 22:13:20,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:20,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:20,754 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:20,793 INFO L322 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2023-11-06 22:13:20,793 INFO L351 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 24 treesize of output 1 [2023-11-06 22:13:20,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,902 INFO L322 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-06 22:13:20,903 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 [2023-11-06 22:13:20,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:20,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:20,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,988 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:20,988 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:21,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:21,046 INFO L322 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-06 22:13:21,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 1 [2023-11-06 22:13:21,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:21,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:21,110 INFO L322 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2023-11-06 22:13:21,111 INFO L351 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 24 treesize of output 1 [2023-11-06 22:13:21,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:21,286 INFO L351 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 29 treesize of output 25 [2023-11-06 22:13:21,468 INFO L322 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2023-11-06 22:13:21,468 INFO L351 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 2 case distinctions, treesize of input 94 treesize of output 1 [2023-11-06 22:13:21,584 INFO L322 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2023-11-06 22:13:21,584 INFO L351 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 2 case distinctions, treesize of input 88 treesize of output 1 [2023-11-06 22:13:21,658 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:21,658 INFO L351 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 [2023-11-06 22:13:21,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:21,744 INFO L351 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 28 treesize of output 24 [2023-11-06 22:13:21,776 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:21,777 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 179 [2023-11-06 22:13:22,229 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:22,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:22,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:22,277 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:22,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 136 [2023-11-06 22:13:22,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:22,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:22,896 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:22,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:23,176 INFO L322 Elim1Store]: treesize reduction 143, result has 31.3 percent of original size [2023-11-06 22:13:23,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 987 treesize of output 953 [2023-11-06 22:13:23,881 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-06 22:13:23,881 INFO L351 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 [2023-11-06 22:13:26,103 INFO L322 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-11-06 22:13:26,104 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 795 treesize of output 769 [2023-11-06 22:13:26,548 INFO L351 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 92 treesize of output 74 [2023-11-06 22:13:26,928 INFO L322 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-11-06 22:13:26,929 INFO L351 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 10939 treesize of output 10689 [2023-11-06 22:13:27,219 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:27,219 INFO L351 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 [2023-11-06 22:13:27,732 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:27,733 INFO L351 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 [2023-11-06 22:13:27,959 INFO L322 Elim1Store]: treesize reduction 33, result has 50.7 percent of original size [2023-11-06 22:13:27,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 98 [2023-11-06 22:13:28,147 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-06 22:13:28,148 INFO L351 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 [2023-11-06 22:13:28,342 INFO L322 Elim1Store]: treesize reduction 9, result has 40.0 percent of original size [2023-11-06 22:13:28,342 INFO L351 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 [2023-11-06 22:13:28,500 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:28,538 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:29,207 INFO L322 Elim1Store]: treesize reduction 156, result has 49.4 percent of original size [2023-11-06 22:13:29,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 18 case distinctions, treesize of input 606 treesize of output 790 [2023-11-06 22:13:35,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:35,081 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:35,093 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:35,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:35,134 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:35,231 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:35,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 1546 treesize of output 1578 [2023-11-06 22:13:36,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:36,224 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,267 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:36,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 468 treesize of output 476 [2023-11-06 22:13:36,582 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,583 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:36,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:36,643 INFO L322 Elim1Store]: treesize reduction 50, result has 16.7 percent of original size [2023-11-06 22:13:36,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 46 [2023-11-06 22:13:36,790 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,795 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,804 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,805 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:36,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:36,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:36,959 INFO L322 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2023-11-06 22:13:36,960 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 301 treesize of output 308 [2023-11-06 22:13:37,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:37,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:37,070 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:37,079 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:13:37,079 INFO L351 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 [2023-11-06 22:13:37,282 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:37,304 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:37,344 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:37,657 INFO L322 Elim1Store]: treesize reduction 138, result has 37.0 percent of original size [2023-11-06 22:13:37,658 INFO L351 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 4456 treesize of output 4495 [2023-11-06 22:13:37,955 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:37,955 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:37,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:37,972 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-06 22:13:37,972 INFO L351 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 45 treesize of output 33 [2023-11-06 22:13:38,544 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:38,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:39,445 INFO L322 Elim1Store]: treesize reduction 499, result has 35.4 percent of original size [2023-11-06 22:13:39,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 540 treesize of output 687 [2023-11-06 22:13:43,878 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:43,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:43,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:43,891 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:43,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:44,208 INFO L322 Elim1Store]: treesize reduction 175, result has 44.8 percent of original size [2023-11-06 22:13:44,209 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 723 treesize of output 801 [2023-11-06 22:13:45,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:45,605 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:45,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:45,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:45,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:45,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2023-11-06 22:13:46,059 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:46,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:46,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:46,101 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:46,116 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:01,563 WARN L293 SmtUtils]: Spent 15.41s on a formula simplification. DAG size of input: 457 DAG size of output: 230 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:14:01,563 INFO L322 Elim1Store]: treesize reduction 1292, result has 31.2 percent of original size [2023-11-06 22:14:01,564 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 10 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 15 new quantified variables, introduced 93 case distinctions, treesize of input 3305 treesize of output 4831 [2023-11-06 22:14:21,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:21,713 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:21,714 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:21,715 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:21,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:21,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:22,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:22,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:22,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:22,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:22,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:22,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:22,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:22,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:24,513 INFO L217 Elim1Store]: Index analysis took 2801 ms [2023-11-06 22:14:24,520 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 982 [2023-11-06 22:14:26,430 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:27,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:27,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:27,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:27,740 INFO L217 Elim1Store]: Index analysis took 1328 ms [2023-11-06 22:14:28,014 INFO L322 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-11-06 22:14:28,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 182 treesize of output 633 [2023-11-06 22:14:28,936 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:28,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:30,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:34,161 INFO L217 Elim1Store]: Index analysis took 5248 ms [2023-11-06 22:14:34,289 INFO L322 Elim1Store]: treesize reduction 282, result has 0.4 percent of original size [2023-11-06 22:14:34,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 25 case distinctions, treesize of input 311 treesize of output 951 [2023-11-06 22:14:35,957 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:35,958 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:35,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:35,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:36,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:36,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:36,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:38,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:38,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:38,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:41,410 INFO L217 Elim1Store]: Index analysis took 5453 ms [2023-11-06 22:14:41,931 INFO L322 Elim1Store]: treesize reduction 114, result has 0.9 percent of original size [2023-11-06 22:14:41,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 332 treesize of output 1047 [2023-11-06 22:14:43,871 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:43,871 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:43,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:14:44,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:47,623 INFO L217 Elim1Store]: Index analysis took 3752 ms [2023-11-06 22:14:47,801 INFO L322 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2023-11-06 22:14:47,801 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 311 treesize of output 951 [2023-11-06 22:15:27,930 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:15:27,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:15:27,942 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:15:27,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:15:28,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:15:28,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:15:28,468 INFO L217 Elim1Store]: Index analysis took 324 ms