./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:59:20,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:59:21,087 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 12:59:21,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:59:21,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:59:21,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:59:21,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:59:21,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:59:21,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:59:21,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:59:21,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:59:21,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:59:21,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:59:21,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:59:21,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:59:21,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:59:21,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:59:21,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:59:21,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:59:21,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:59:21,132 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 12:59:21,132 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 12:59:21,133 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 12:59:21,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:59:21,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:59:21,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:59:21,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:59:21,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:59:21,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:59:21,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:59:21,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:59:21,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:59:21,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:59:21,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:59:21,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:59:21,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:59:21,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:59:21,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:59:21,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:59:21,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:59:21,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:59:21,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:59:21,136 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2024-11-13 12:59:21,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:59:21,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:59:21,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:59:21,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:59:21,545 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:59:21,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/dll2c_update_all.i Unable to find full path for "g++" [2024-11-13 12:59:23,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:59:24,267 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:59:24,268 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/sv-benchmarks/c/list-simple/dll2c_update_all.i [2024-11-13 12:59:24,283 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/data/2a7c44247/bfac7cd0c36649b2b9f5f94829ec1556/FLAGe41fb86ef [2024-11-13 12:59:24,302 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/data/2a7c44247/bfac7cd0c36649b2b9f5f94829ec1556 [2024-11-13 12:59:24,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:59:24,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:59:24,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:59:24,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:59:24,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:59:24,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:24,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e932fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24, skipping insertion in model container [2024-11-13 12:59:24,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:24,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:59:24,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:59:24,769 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:59:24,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:59:24,907 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:59:24,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24 WrapperNode [2024-11-13 12:59:24,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:59:24,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:59:24,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:59:24,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:59:24,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:24,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:24,982 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-13 12:59:24,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:59:24,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:59:24,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:59:24,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:59:24,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:24,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:24,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:25,033 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-11-13 12:59:25,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:25,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:25,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:25,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:25,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:25,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:25,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:59:25,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:59:25,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:59:25,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:59:25,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (1/1) ... [2024-11-13 12:59:25,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:59:25,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:25,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:59:25,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:59:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 12:59:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 12:59:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 12:59:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 12:59:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 12:59:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 12:59:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 12:59:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:59:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 12:59:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 12:59:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 12:59:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 12:59:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 12:59:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:59:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 12:59:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:59:25,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:59:25,365 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:59:25,367 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:59:25,888 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-13 12:59:25,888 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:59:25,911 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:59:25,914 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-13 12:59:25,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:59:25 BoogieIcfgContainer [2024-11-13 12:59:25,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:59:25,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:59:25,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:59:25,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:59:25,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:59:24" (1/3) ... [2024-11-13 12:59:25,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f1cb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:59:25, skipping insertion in model container [2024-11-13 12:59:25,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:59:24" (2/3) ... [2024-11-13 12:59:25,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f1cb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:59:25, skipping insertion in model container [2024-11-13 12:59:25,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:59:25" (3/3) ... [2024-11-13 12:59:25,930 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2024-11-13 12:59:25,952 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:59:25,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_update_all.i that has 2 procedures, 94 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2024-11-13 12:59:26,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:59:26,035 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a10dac7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:59:26,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2024-11-13 12:59:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 90 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 12:59:26,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:26,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 12:59:26,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:26,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2024-11-13 12:59:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:26,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808400771] [2024-11-13 12:59:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:26,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:26,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808400771] [2024-11-13 12:59:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808400771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:26,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:26,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:59:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694699045] [2024-11-13 12:59:26,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:26,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:26,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:26,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:26,375 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 90 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:26,542 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-13 12:59:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:26,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 12:59:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:26,555 INFO L225 Difference]: With dead ends: 90 [2024-11-13 12:59:26,555 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 12:59:26,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:26,563 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:26,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 151 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 12:59:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-13 12:59:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-13 12:59:26,630 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2024-11-13 12:59:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:26,631 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-13 12:59:26,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-13 12:59:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 12:59:26,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:26,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 12:59:26,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:59:26,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:26,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:26,633 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2024-11-13 12:59:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896514377] [2024-11-13 12:59:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:26,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:26,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:26,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896514377] [2024-11-13 12:59:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896514377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:26,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:26,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:59:26,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191790895] [2024-11-13 12:59:26,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:26,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:26,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:26,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:26,871 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:26,982 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-13 12:59:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 12:59:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:26,984 INFO L225 Difference]: With dead ends: 84 [2024-11-13 12:59:26,984 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 12:59:26,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:26,985 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:26,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 152 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 12:59:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-13 12:59:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-11-13 12:59:27,001 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2024-11-13 12:59:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:27,002 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-11-13 12:59:27,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:59:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-11-13 12:59:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 12:59:27,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:27,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:27,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:59:27,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:27,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244439, now seen corresponding path program 1 times [2024-11-13 12:59:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:27,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471034229] [2024-11-13 12:59:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:27,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:27,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471034229] [2024-11-13 12:59:27,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471034229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:27,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:27,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:59:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329793172] [2024-11-13 12:59:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:27,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:27,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:27,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:27,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:27,292 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:59:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:27,470 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-11-13 12:59:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:59:27,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-13 12:59:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:27,472 INFO L225 Difference]: With dead ends: 95 [2024-11-13 12:59:27,472 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 12:59:27,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:27,474 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 10 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:27,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 220 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:59:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 12:59:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2024-11-13 12:59:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-11-13 12:59:27,492 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2024-11-13 12:59:27,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:27,493 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-11-13 12:59:27,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:59:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-11-13 12:59:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 12:59:27,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:27,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:27,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:59:27,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:27,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash 414001409, now seen corresponding path program 1 times [2024-11-13 12:59:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:27,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893478650] [2024-11-13 12:59:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:27,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:27,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 12:59:27,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893478650] [2024-11-13 12:59:27,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893478650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:27,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:27,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:59:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326875386] [2024-11-13 12:59:27,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:27,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:59:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:27,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:59:27,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:27,894 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:28,178 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-13 12:59:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:59:28,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-13 12:59:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:28,180 INFO L225 Difference]: With dead ends: 84 [2024-11-13 12:59:28,180 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 12:59:28,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:28,181 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:28,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 332 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:59:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 12:59:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-13 12:59:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-11-13 12:59:28,195 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2024-11-13 12:59:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:28,195 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-11-13 12:59:28,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-11-13 12:59:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 12:59:28,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:28,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:28,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:59:28,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:28,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash 414001410, now seen corresponding path program 1 times [2024-11-13 12:59:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663376137] [2024-11-13 12:59:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:28,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:28,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:28,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663376137] [2024-11-13 12:59:28,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663376137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:28,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:28,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:59:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779024309] [2024-11-13 12:59:28,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:28,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:59:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:28,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:59:28,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:28,828 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:29,091 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2024-11-13 12:59:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:59:29,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-13 12:59:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:29,092 INFO L225 Difference]: With dead ends: 83 [2024-11-13 12:59:29,092 INFO L226 Difference]: Without dead ends: 83 [2024-11-13 12:59:29,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:29,093 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:29,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 354 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:59:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-13 12:59:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-13 12:59:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2024-11-13 12:59:29,107 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2024-11-13 12:59:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:29,107 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2024-11-13 12:59:29,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2024-11-13 12:59:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 12:59:29,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:29,108 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:29,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:59:29,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:29,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1576604798, now seen corresponding path program 1 times [2024-11-13 12:59:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:29,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271461215] [2024-11-13 12:59:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:29,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:29,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271461215] [2024-11-13 12:59:29,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271461215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233591803] [2024-11-13 12:59:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:29,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:29,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:59:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:29,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 12:59:29,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:29,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:59:30,078 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-13 12:59:30,161 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 12:59:30,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-13 12:59:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-13 12:59:30,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:59:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:30,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233591803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:59:30,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:59:30,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-13 12:59:30,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18269689] [2024-11-13 12:59:30,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:59:30,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:59:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:59:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-13 12:59:30,551 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 12:59:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:30,990 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-11-13 12:59:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:59:30,991 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-13 12:59:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:30,992 INFO L225 Difference]: With dead ends: 88 [2024-11-13 12:59:30,993 INFO L226 Difference]: Without dead ends: 88 [2024-11-13 12:59:30,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-13 12:59:30,994 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:30,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2024-11-13 12:59:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-13 12:59:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-13 12:59:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 12:59:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2024-11-13 12:59:31,011 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2024-11-13 12:59:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:31,012 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2024-11-13 12:59:31,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 12:59:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2024-11-13 12:59:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 12:59:31,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:31,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:31,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:59:31,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 12:59:31,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1576604797, now seen corresponding path program 1 times [2024-11-13 12:59:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834771302] [2024-11-13 12:59:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:31,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:31,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:32,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834771302] [2024-11-13 12:59:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834771302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530459258] [2024-11-13 12:59:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:32,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:32,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:32,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:32,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:59:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:32,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 12:59:32,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:32,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 12:59:32,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:59:32,675 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 12:59:32,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 12:59:32,705 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:59:32,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 12:59:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:32,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:59:32,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530459258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:32,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:59:32,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-11-13 12:59:32,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922041846] [2024-11-13 12:59:32,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:59:32,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 12:59:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 12:59:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:59:32,983 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 12:59:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:33,497 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-13 12:59:33,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:59:33,498 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-13 12:59:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:33,499 INFO L225 Difference]: With dead ends: 88 [2024-11-13 12:59:33,499 INFO L226 Difference]: Without dead ends: 88 [2024-11-13 12:59:33,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:59:33,502 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:33,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 458 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:59:33,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-13 12:59:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-13 12:59:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 12:59:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-11-13 12:59:33,516 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2024-11-13 12:59:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:33,517 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-11-13 12:59:33,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 12:59:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-11-13 12:59:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 12:59:33,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:33,518 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:33,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 12:59:33,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:33,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:33,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1006398712, now seen corresponding path program 1 times [2024-11-13 12:59:33,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:33,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203507161] [2024-11-13 12:59:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:33,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:33,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:34,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:34,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203507161] [2024-11-13 12:59:34,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203507161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408522410] [2024-11-13 12:59:34,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:34,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:34,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:34,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:34,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:59:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:34,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 12:59:34,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:34,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:59:34,399 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 12:59:34,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 12:59:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:34,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:59:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408522410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:59:34,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:59:34,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2024-11-13 12:59:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122497543] [2024-11-13 12:59:34,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:59:34,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 12:59:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:34,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 12:59:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-13 12:59:34,955 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 12:59:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:35,475 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-13 12:59:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:59:35,475 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-11-13 12:59:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:35,476 INFO L225 Difference]: With dead ends: 87 [2024-11-13 12:59:35,476 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 12:59:35,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:59:35,478 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 43 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:35,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 785 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:59:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 12:59:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-13 12:59:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 82 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 12:59:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-13 12:59:35,489 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 28 [2024-11-13 12:59:35,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:35,490 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-13 12:59:35,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 12:59:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-13 12:59:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 12:59:35,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:35,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:35,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 12:59:35,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:35,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:35,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1128808337, now seen corresponding path program 1 times [2024-11-13 12:59:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:35,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886109895] [2024-11-13 12:59:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:35,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:35,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:36,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:36,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886109895] [2024-11-13 12:59:36,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886109895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:36,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864906414] [2024-11-13 12:59:36,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:36,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:36,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:36,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:36,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:59:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:36,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 12:59:36,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:36,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 12:59:36,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:59:36,550 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-13 12:59:36,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:59:36,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 12:59:36,647 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:59:36,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 12:59:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-13 12:59:36,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:59:36,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864906414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:36,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:59:36,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-13 12:59:36,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382702404] [2024-11-13 12:59:36,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:59:36,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 12:59:36,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:36,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 12:59:36,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-13 12:59:36,909 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 12:59:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:37,371 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-11-13 12:59:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:59:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-13 12:59:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:37,374 INFO L225 Difference]: With dead ends: 104 [2024-11-13 12:59:37,374 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 12:59:37,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-13 12:59:37,376 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:37,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 582 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 293 Invalid, 0 Unknown, 111 Unchecked, 0.3s Time] [2024-11-13 12:59:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 12:59:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2024-11-13 12:59:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 91 states have internal predecessors, (104), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:59:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-11-13 12:59:37,382 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 29 [2024-11-13 12:59:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:37,383 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-11-13 12:59:37,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 12:59:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-11-13 12:59:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 12:59:37,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:37,384 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:37,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:59:37,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:37,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:37,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash 633320052, now seen corresponding path program 1 times [2024-11-13 12:59:37,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:37,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998736030] [2024-11-13 12:59:37,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:37,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 12:59:37,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:37,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998736030] [2024-11-13 12:59:37,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998736030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:37,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:37,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:59:37,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892962779] [2024-11-13 12:59:37,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:37,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:59:37,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:37,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:59:37,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:59:37,810 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:38,063 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-11-13 12:59:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:59:38,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-13 12:59:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:38,065 INFO L225 Difference]: With dead ends: 96 [2024-11-13 12:59:38,066 INFO L226 Difference]: Without dead ends: 96 [2024-11-13 12:59:38,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:59:38,067 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:38,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 370 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:59:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-13 12:59:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-13 12:59:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.537313432835821) internal successors, (103), 90 states have internal predecessors, (103), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:59:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-11-13 12:59:38,077 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 30 [2024-11-13 12:59:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:38,078 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-11-13 12:59:38,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-11-13 12:59:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 12:59:38,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:38,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:38,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:59:38,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:38,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash 633320053, now seen corresponding path program 1 times [2024-11-13 12:59:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:38,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982922591] [2024-11-13 12:59:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:38,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:38,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982922591] [2024-11-13 12:59:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982922591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:38,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:59:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221738192] [2024-11-13 12:59:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:38,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:59:38,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:38,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:59:38,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:59:38,511 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:38,767 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2024-11-13 12:59:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:59:38,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-13 12:59:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:38,768 INFO L225 Difference]: With dead ends: 95 [2024-11-13 12:59:38,768 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 12:59:38,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:59:38,770 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 9 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:38,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 409 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:59:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 12:59:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-13 12:59:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 89 states have internal predecessors, (102), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:59:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-11-13 12:59:38,775 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 30 [2024-11-13 12:59:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:38,776 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-11-13 12:59:38,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-11-13 12:59:38,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 12:59:38,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:38,777 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:38,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:59:38,777 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:38,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash 513324197, now seen corresponding path program 1 times [2024-11-13 12:59:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:38,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252466939] [2024-11-13 12:59:38,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 12:59:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252466939] [2024-11-13 12:59:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252466939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:39,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:39,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:59:39,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061672995] [2024-11-13 12:59:39,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:39,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:59:39,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:39,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:59:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:59:39,087 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:39,482 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2024-11-13 12:59:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:59:39,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-13 12:59:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:39,484 INFO L225 Difference]: With dead ends: 98 [2024-11-13 12:59:39,484 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 12:59:39,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:59:39,485 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 44 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:39,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 445 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:59:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 12:59:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-13 12:59:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.542857142857143) internal successors, (108), 92 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:59:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2024-11-13 12:59:39,492 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 35 [2024-11-13 12:59:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:39,493 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2024-11-13 12:59:39,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2024-11-13 12:59:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 12:59:39,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:39,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:39,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 12:59:39,494 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:39,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash 513324198, now seen corresponding path program 1 times [2024-11-13 12:59:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:39,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504671991] [2024-11-13 12:59:39,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:39,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:39,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:39,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504671991] [2024-11-13 12:59:39,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504671991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:39,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:39,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:59:39,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539594120] [2024-11-13 12:59:39,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:39,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:59:39,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:39,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:59:39,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:59:39,997 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:40,358 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2024-11-13 12:59:40,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:59:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-13 12:59:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:40,359 INFO L225 Difference]: With dead ends: 98 [2024-11-13 12:59:40,359 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 12:59:40,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:59:40,360 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 41 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:40,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 494 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:59:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 12:59:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-13 12:59:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 92 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:59:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2024-11-13 12:59:40,385 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 35 [2024-11-13 12:59:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:40,385 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2024-11-13 12:59:40,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2024-11-13 12:59:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 12:59:40,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:40,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:40,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 12:59:40,387 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:40,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash -617979381, now seen corresponding path program 1 times [2024-11-13 12:59:40,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:40,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907230876] [2024-11-13 12:59:40,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:40,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:40,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:40,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 12:59:40,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:40,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907230876] [2024-11-13 12:59:40,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907230876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:40,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:40,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:59:40,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983634781] [2024-11-13 12:59:40,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:40,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:59:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:40,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:59:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:59:40,669 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:41,046 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2024-11-13 12:59:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:59:41,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-13 12:59:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:41,047 INFO L225 Difference]: With dead ends: 101 [2024-11-13 12:59:41,048 INFO L226 Difference]: Without dead ends: 101 [2024-11-13 12:59:41,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:59:41,049 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:41,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 445 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:59:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-13 12:59:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-13 12:59:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 95 states have internal predecessors, (112), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:59:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2024-11-13 12:59:41,054 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 37 [2024-11-13 12:59:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:41,054 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2024-11-13 12:59:41,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2024-11-13 12:59:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 12:59:41,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:41,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:41,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 12:59:41,056 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:41,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:41,056 INFO L85 PathProgramCache]: Analyzing trace with hash -617979380, now seen corresponding path program 1 times [2024-11-13 12:59:41,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:41,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086181026] [2024-11-13 12:59:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 12:59:41,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:41,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086181026] [2024-11-13 12:59:41,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086181026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:41,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304620517] [2024-11-13 12:59:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:41,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:41,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:41,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:41,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:59:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:41,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 12:59:41,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 12:59:41,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304620517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:59:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-13 12:59:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274254104] [2024-11-13 12:59:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:41,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:41,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:41,536 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:41,563 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2024-11-13 12:59:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:59:41,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-13 12:59:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:41,565 INFO L225 Difference]: With dead ends: 133 [2024-11-13 12:59:41,565 INFO L226 Difference]: Without dead ends: 133 [2024-11-13 12:59:41,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:41,566 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 61 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:41,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 194 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-13 12:59:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 103. [2024-11-13 12:59:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.52) internal successors, (114), 97 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:59:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2024-11-13 12:59:41,570 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 37 [2024-11-13 12:59:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:41,571 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2024-11-13 12:59:41,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2024-11-13 12:59:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 12:59:41,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:41,572 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:41,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:59:41,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 12:59:41,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1935721109, now seen corresponding path program 1 times [2024-11-13 12:59:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832680733] [2024-11-13 12:59:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:41,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 12:59:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832680733] [2024-11-13 12:59:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832680733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:41,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:41,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:59:41,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57417004] [2024-11-13 12:59:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:41,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:59:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:41,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:59:41,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:59:41,892 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:41,984 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2024-11-13 12:59:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:59:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-13 12:59:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:41,987 INFO L225 Difference]: With dead ends: 124 [2024-11-13 12:59:41,988 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 12:59:41,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:59:41,988 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 19 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:41,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 281 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:41,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 12:59:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2024-11-13 12:59:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.513157894736842) internal successors, (115), 98 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:59:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2024-11-13 12:59:41,993 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 38 [2024-11-13 12:59:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:41,993 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2024-11-13 12:59:41,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2024-11-13 12:59:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 12:59:41,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:41,994 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:41,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 12:59:41,994 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:41,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:41,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1208307397, now seen corresponding path program 1 times [2024-11-13 12:59:41,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:41,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899131918] [2024-11-13 12:59:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:41,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:42,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:42,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 12:59:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 12:59:42,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:42,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899131918] [2024-11-13 12:59:42,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899131918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:42,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766690607] [2024-11-13 12:59:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:42,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:42,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:42,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:42,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:59:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:42,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:59:42,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 12:59:42,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:42,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766690607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:42,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:59:42,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-13 12:59:42,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61965411] [2024-11-13 12:59:42,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:42,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:42,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:42,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:59:42,435 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 12:59:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:42,455 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-11-13 12:59:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:59:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-13 12:59:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:42,456 INFO L225 Difference]: With dead ends: 86 [2024-11-13 12:59:42,456 INFO L226 Difference]: Without dead ends: 86 [2024-11-13 12:59:42,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:59:42,458 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:42,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-13 12:59:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-13 12:59:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-13 12:59:42,463 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 41 [2024-11-13 12:59:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:42,463 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-13 12:59:42,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 12:59:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-13 12:59:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 12:59:42,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:42,464 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:42,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 12:59:42,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 12:59:42,666 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:42,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash 112195202, now seen corresponding path program 1 times [2024-11-13 12:59:42,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:42,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310043289] [2024-11-13 12:59:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 12:59:42,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310043289] [2024-11-13 12:59:42,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310043289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737779136] [2024-11-13 12:59:42,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:42,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:42,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:42,891 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:42,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:59:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:43,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:59:43,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 12:59:43,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:59:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 12:59:43,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737779136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:59:43,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:59:43,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-13 12:59:43,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731262632] [2024-11-13 12:59:43,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:59:43,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:59:43,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:43,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:59:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:59:43,307 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 12:59:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:43,467 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2024-11-13 12:59:43,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:59:43,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-13 12:59:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:43,468 INFO L225 Difference]: With dead ends: 138 [2024-11-13 12:59:43,468 INFO L226 Difference]: Without dead ends: 138 [2024-11-13 12:59:43,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:59:43,469 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 97 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:43,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 466 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-13 12:59:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 100. [2024-11-13 12:59:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 96 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2024-11-13 12:59:43,475 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 41 [2024-11-13 12:59:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:43,476 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-11-13 12:59:43,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 12:59:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2024-11-13 12:59:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 12:59:43,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:43,477 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:43,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 12:59:43,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 12:59:43,681 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:43,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:43,682 INFO L85 PathProgramCache]: Analyzing trace with hash -775145547, now seen corresponding path program 1 times [2024-11-13 12:59:43,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:43,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5787761] [2024-11-13 12:59:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5787761] [2024-11-13 12:59:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5787761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352564326] [2024-11-13 12:59:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:45,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:45,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:45,006 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:45,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:59:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:45,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-13 12:59:45,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:45,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:59:45,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:59:45,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 12:59:45,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 12:59:45,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 12:59:45,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 12:59:45,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 12:59:46,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:59:46,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:59:46,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:59:46,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-13 12:59:46,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:59:46,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-11-13 12:59:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:46,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:59:46,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2129 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2129) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2129 .cse0))) v_ArrVal_2129)))) is different from false [2024-11-13 12:59:46,569 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-13 12:59:46,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 12:59:47,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:59:47,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-13 12:59:47,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-13 12:59:47,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-13 12:59:47,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-13 12:59:47,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352564326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:47,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:59:47,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2024-11-13 12:59:47,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304979925] [2024-11-13 12:59:47,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:59:47,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 12:59:47,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:47,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 12:59:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1648, Unknown=41, NotChecked=82, Total=1892 [2024-11-13 12:59:47,678 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 12:59:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:49,686 INFO L93 Difference]: Finished difference Result 150 states and 189 transitions. [2024-11-13 12:59:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 12:59:49,687 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-13 12:59:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:49,688 INFO L225 Difference]: With dead ends: 150 [2024-11-13 12:59:49,688 INFO L226 Difference]: Without dead ends: 150 [2024-11-13 12:59:49,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=189, Invalid=2528, Unknown=43, NotChecked=102, Total=2862 [2024-11-13 12:59:49,690 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 115 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:49,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1298 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 12:59:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-13 12:59:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 109. [2024-11-13 12:59:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.5) internal successors, (129), 105 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2024-11-13 12:59:49,694 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 42 [2024-11-13 12:59:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:49,695 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2024-11-13 12:59:49,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 12:59:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2024-11-13 12:59:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 12:59:49,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:49,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:49,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 12:59:49,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:49,900 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:49,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:49,901 INFO L85 PathProgramCache]: Analyzing trace with hash -775145546, now seen corresponding path program 1 times [2024-11-13 12:59:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:49,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986117766] [2024-11-13 12:59:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:49,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:51,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986117766] [2024-11-13 12:59:51,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986117766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:51,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440794771] [2024-11-13 12:59:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:51,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:51,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:51,831 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:51,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 12:59:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:52,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-13 12:59:52,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:52,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 12:59:52,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:59:52,733 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 12:59:52,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 12:59:52,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:59:52,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 12:59:52,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 12:59:52,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 12:59:53,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 12:59:53,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-13 12:59:53,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 12:59:53,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 12:59:53,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 12:59:53,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 12:59:53,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:59:53,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:59:53,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2024-11-13 12:59:54,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:59:54,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 12:59:54,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 16 [2024-11-13 12:59:54,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 12:59:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:54,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:59:54,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2323 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2323 .cse1)) v_ArrVal_2323)) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2323) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_2323 (Array Int Int))) (or (forall ((v_ArrVal_2324 (Array Int Int))) (or (not (= v_ArrVal_2324 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_2324 .cse1)))) (< (+ 11 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2323) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2324) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (not (= (store .cse0 .cse1 (select v_ArrVal_2323 .cse1)) v_ArrVal_2323)))))) is different from false [2024-11-13 12:59:55,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:59:55,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-13 12:59:55,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2024-11-13 12:59:55,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-13 12:59:55,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-13 12:59:55,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:59:55,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2024-11-13 12:59:55,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:59:55,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-13 12:59:55,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:59:55,571 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:59:55,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 22 [2024-11-13 12:59:55,579 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:59:55,579 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:59:55,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-13 12:59:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440794771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:56,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:59:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2024-11-13 12:59:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762277689] [2024-11-13 12:59:56,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:59:56,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 12:59:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:56,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 12:59:56,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2606, Unknown=3, NotChecked=102, Total=2862 [2024-11-13 12:59:56,024 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 41 states, 40 states have (on average 1.775) internal successors, (71), 35 states have internal predecessors, (71), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 12:59:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:57,979 INFO L93 Difference]: Finished difference Result 159 states and 201 transitions. [2024-11-13 12:59:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:59:57,980 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.775) internal successors, (71), 35 states have internal predecessors, (71), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2024-11-13 12:59:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:57,981 INFO L225 Difference]: With dead ends: 159 [2024-11-13 12:59:57,981 INFO L226 Difference]: Without dead ends: 159 [2024-11-13 12:59:57,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=251, Invalid=4172, Unknown=3, NotChecked=130, Total=4556 [2024-11-13 12:59:57,984 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 80 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:57,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1508 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 12:59:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-13 12:59:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 116. [2024-11-13 12:59:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 112 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2024-11-13 12:59:57,989 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 42 [2024-11-13 12:59:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:57,990 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2024-11-13 12:59:57,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.775) internal successors, (71), 35 states have internal predecessors, (71), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 12:59:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2024-11-13 12:59:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 12:59:57,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:57,991 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:58,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 12:59:58,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:58,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:58,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash 332029944, now seen corresponding path program 2 times [2024-11-13 12:59:58,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:58,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36605185] [2024-11-13 12:59:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:58,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:58,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 12:59:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:58,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36605185] [2024-11-13 12:59:58,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36605185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:58,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959986486] [2024-11-13 12:59:58,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:59:58,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:58,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:58,344 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:58,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 12:59:58,592 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 12:59:58,593 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:59:58,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 12:59:58,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:58,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 12:59:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 12:59:58,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959986486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:59:58,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 14 [2024-11-13 12:59:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879155045] [2024-11-13 12:59:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:58,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:59:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:59:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:59:58,847 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:59,047 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2024-11-13 12:59:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:59:59,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-13 12:59:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:59,048 INFO L225 Difference]: With dead ends: 116 [2024-11-13 12:59:59,048 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 12:59:59,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:59:59,049 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:59,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 432 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:59:59,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 12:59:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-13 12:59:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 112 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2024-11-13 12:59:59,056 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 45 [2024-11-13 12:59:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:59,056 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2024-11-13 12:59:59,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2024-11-13 12:59:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 12:59:59,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:59,057 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:59,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 12:59:59,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:59,261 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 12:59:59,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1679827035, now seen corresponding path program 2 times [2024-11-13 12:59:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:59,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163998802] [2024-11-13 12:59:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:59:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:59:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 12:59:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163998802] [2024-11-13 12:59:59,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163998802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:59,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118605830] [2024-11-13 12:59:59,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:59:59,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:59,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:59,457 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:59,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 12:59:59,868 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:59:59,868 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:59:59,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:59:59,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 12:59:59,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:59:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 12:59:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118605830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:59:59,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:59:59,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-11-13 12:59:59,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395911926] [2024-11-13 12:59:59,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:59:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:59:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:59,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:59:59,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:59,950 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 13:00:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:00,044 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2024-11-13 13:00:00,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:00:00,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2024-11-13 13:00:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:00,045 INFO L225 Difference]: With dead ends: 103 [2024-11-13 13:00:00,045 INFO L226 Difference]: Without dead ends: 103 [2024-11-13 13:00:00,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:00:00,047 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:00,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 306 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:00,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-13 13:00:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-13 13:00:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 99 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2024-11-13 13:00:00,055 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 45 [2024-11-13 13:00:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:00,055 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2024-11-13 13:00:00,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 13:00:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2024-11-13 13:00:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 13:00:00,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:00,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:00,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:00:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:00,256 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash 196048121, now seen corresponding path program 1 times [2024-11-13 13:00:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428841839] [2024-11-13 13:00:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 13:00:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428841839] [2024-11-13 13:00:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428841839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:00:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41434980] [2024-11-13 13:00:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:00,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:00:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:00:00,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:00:00,393 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:00,482 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-11-13 13:00:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:00:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-13 13:00:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:00,483 INFO L225 Difference]: With dead ends: 102 [2024-11-13 13:00:00,483 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 13:00:00,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:00:00,485 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 12 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:00,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 258 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 13:00:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-13 13:00:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 94 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2024-11-13 13:00:00,494 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 48 [2024-11-13 13:00:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:00,494 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2024-11-13 13:00:00,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2024-11-13 13:00:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 13:00:00,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:00,495 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:00,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 13:00:00,495 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:00,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1732387493, now seen corresponding path program 3 times [2024-11-13 13:00:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172634318] [2024-11-13 13:00:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:00,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 13:00:00,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:00,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172634318] [2024-11-13 13:00:00,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172634318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:00,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627193479] [2024-11-13 13:00:00,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:00:00,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:00,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:00,687 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:00,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:00:01,353 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 13:00:01,353 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:00:01,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:00:01,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 13:00:01,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:00:01,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627193479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:01,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:00:01,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-13 13:00:01,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956425084] [2024-11-13 13:00:01,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:01,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:00:01,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:01,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:00:01,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:01,465 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:01,504 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-11-13 13:00:01,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:00:01,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2024-11-13 13:00:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:01,505 INFO L225 Difference]: With dead ends: 96 [2024-11-13 13:00:01,505 INFO L226 Difference]: Without dead ends: 96 [2024-11-13 13:00:01,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:01,506 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 36 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:01,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 209 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:00:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-13 13:00:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2024-11-13 13:00:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3) internal successors, (91), 85 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2024-11-13 13:00:01,514 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 49 [2024-11-13 13:00:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2024-11-13 13:00:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2024-11-13 13:00:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-13 13:00:01,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:01,515 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:01,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 13:00:01,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:01,716 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:01,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2039398521, now seen corresponding path program 1 times [2024-11-13 13:00:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:01,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192786417] [2024-11-13 13:00:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:01,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:01,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:01,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:00:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192786417] [2024-11-13 13:00:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192786417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512718887] [2024-11-13 13:00:01,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:01,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:01,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:01,872 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:01,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:00:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:02,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:00:02,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:00:02,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:00:02,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512718887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:02,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:02,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-13 13:00:02,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825881098] [2024-11-13 13:00:02,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:02,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:00:02,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:02,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:00:02,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:00:02,244 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:02,357 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-13 13:00:02,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:00:02,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2024-11-13 13:00:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:02,358 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:00:02,358 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 13:00:02,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:00:02,359 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 61 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:02,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 282 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 13:00:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-13 13:00:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 85 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-13 13:00:02,362 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 51 [2024-11-13 13:00:02,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:02,363 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-13 13:00:02,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:02,363 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-13 13:00:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-13 13:00:02,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:02,364 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:02,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:00:02,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 13:00:02,564 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:02,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:02,565 INFO L85 PathProgramCache]: Analyzing trace with hash -677269087, now seen corresponding path program 1 times [2024-11-13 13:00:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:02,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094928704] [2024-11-13 13:00:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:00:04,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094928704] [2024-11-13 13:00:04,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094928704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:04,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291425326] [2024-11-13 13:00:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:04,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:04,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:04,490 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:04,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:00:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:04,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-13 13:00:04,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:04,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:05,096 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:00:05,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:00:05,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:00:05,265 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:05,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-13 13:00:05,372 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:00:05,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 13:00:05,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 13:00:05,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 13:00:05,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2024-11-13 13:00:05,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-13 13:00:06,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 13:00:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:06,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:06,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3402 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3402) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-13 13:00:06,743 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3402 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3402) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-13 13:00:06,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:06,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-13 13:00:06,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:06,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2024-11-13 13:00:06,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-13 13:00:07,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3397 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3397) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-13 13:00:07,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:07,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-13 13:00:07,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-11-13 13:00:07,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 13:00:07,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 13:00:07,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 13:00:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 13:00:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291425326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:07,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:07,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 28] total 75 [2024-11-13 13:00:07,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876719223] [2024-11-13 13:00:07,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:07,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-13 13:00:07,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:07,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-13 13:00:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=4796, Unknown=84, NotChecked=426, Total=5550 [2024-11-13 13:00:07,851 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 75 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 66 states have internal predecessors, (128), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-13 13:00:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:10,398 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-11-13 13:00:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 13:00:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 66 states have internal predecessors, (128), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2024-11-13 13:00:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:10,400 INFO L225 Difference]: With dead ends: 89 [2024-11-13 13:00:10,400 INFO L226 Difference]: Without dead ends: 89 [2024-11-13 13:00:10,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=468, Invalid=7830, Unknown=86, NotChecked=546, Total=8930 [2024-11-13 13:00:10,402 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 137 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:10,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 2028 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1602 Invalid, 0 Unknown, 176 Unchecked, 1.2s Time] [2024-11-13 13:00:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-13 13:00:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-13 13:00:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-11-13 13:00:10,406 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 54 [2024-11-13 13:00:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:10,406 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-11-13 13:00:10,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 66 states have internal predecessors, (128), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-13 13:00:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-11-13 13:00:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 13:00:10,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:10,407 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:10,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-13 13:00:10,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-13 13:00:10,611 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:10,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:10,611 INFO L85 PathProgramCache]: Analyzing trace with hash 940170861, now seen corresponding path program 1 times [2024-11-13 13:00:10,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:10,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606011306] [2024-11-13 13:00:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:10,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:00:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606011306] [2024-11-13 13:00:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606011306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114666525] [2024-11-13 13:00:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:11,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:11,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:11,988 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:11,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 13:00:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:12,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-13 13:00:12,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:12,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:12,441 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:00:12,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:00:12,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:00:12,572 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:12,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-13 13:00:12,689 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:00:12,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 13:00:12,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 13:00:13,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:13,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:13,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:13,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-13 13:00:13,251 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:13,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2024-11-13 13:00:13,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:13,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-11-13 13:00:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 13:00:13,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:13,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3603 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3603) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-13 13:00:13,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3603 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3603) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-13 13:00:13,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3603 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3603) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-13 13:00:13,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3602))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3603)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_3602 .cse1))) v_ArrVal_3602)))) is different from false [2024-11-13 13:00:13,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3602) (select v_ArrVal_3602 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3603) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_3602 .cse0))) v_ArrVal_3602)))) is different from false [2024-11-13 13:00:13,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (or (not (= v_ArrVal_3602 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_3602 .cse0))))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3602) (select v_ArrVal_3602 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3603) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2024-11-13 13:00:13,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_3602 .cse0))) v_ArrVal_3602)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3602) (select v_ArrVal_3602 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3603) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-13 13:00:13,630 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_3602 .cse0))) v_ArrVal_3602)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3602) (select v_ArrVal_3602 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3603) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-13 13:00:13,658 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-13 13:00:13,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-13 13:00:13,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3600 (Array Int Int)) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3600))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3602) (select v_ArrVal_3602 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3603) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_3602 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3602 .cse1)))))))) is different from false [2024-11-13 13:00:13,712 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3600 (Array Int Int)) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3600))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_3602 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3602 .cse1))))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3602) (select v_ArrVal_3602 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3603) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2024-11-13 13:00:13,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3599 (Array Int Int)) (v_ArrVal_3600 (Array Int Int)) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3599) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3600))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3602) (select v_ArrVal_3602 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3603) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3602 .cse1))) v_ArrVal_3602)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-13 13:00:13,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:13,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2024-11-13 13:00:13,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 221 [2024-11-13 13:00:13,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:13,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:13,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 109 [2024-11-13 13:00:13,803 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:13,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:13,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:13,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 105 [2024-11-13 13:00:13,831 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:13,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:13,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2024-11-13 13:00:13,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-13 13:00:13,989 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:13,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 117 [2024-11-13 13:00:14,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:14,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:14,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2024-11-13 13:00:14,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-13 13:00:14,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114666525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:14,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:00:14,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 43 [2024-11-13 13:00:14,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036189199] [2024-11-13 13:00:14,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:14,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-13 13:00:14,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:14,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-13 13:00:14,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1918, Unknown=29, NotChecked=1078, Total=3192 [2024-11-13 13:00:14,183 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 39 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 13:00:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:15,292 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-13 13:00:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 13:00:15,293 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 39 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2024-11-13 13:00:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:15,294 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:00:15,294 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 13:00:15,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=260, Invalid=3060, Unknown=30, NotChecked=1342, Total=4692 [2024-11-13 13:00:15,295 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 82 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:15,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1212 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:00:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 13:00:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-13 13:00:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 89 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-11-13 13:00:15,299 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 57 [2024-11-13 13:00:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:15,299 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-11-13 13:00:15,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 39 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 13:00:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-13 13:00:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 13:00:15,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:15,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:15,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 13:00:15,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:15,501 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:15,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:15,501 INFO L85 PathProgramCache]: Analyzing trace with hash 940170862, now seen corresponding path program 1 times [2024-11-13 13:00:15,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:15,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268040390] [2024-11-13 13:00:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:17,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:17,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:00:17,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:17,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268040390] [2024-11-13 13:00:17,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268040390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:17,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203515801] [2024-11-13 13:00:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:17,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:17,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:17,436 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:17,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 13:00:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:17,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-13 13:00:17,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:17,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:00:17,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:18,224 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:00:18,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 13:00:18,239 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:00:18,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:00:18,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:00:18,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:00:18,494 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:18,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-13 13:00:18,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-13 13:00:18,661 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:00:18,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:00:18,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:18,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:00:18,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 13:00:18,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 13:00:19,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:19,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:19,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2024-11-13 13:00:19,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:19,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 13:00:19,453 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:19,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2024-11-13 13:00:19,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:19,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:00:19,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 16 [2024-11-13 13:00:19,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:00:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 13:00:19,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:20,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3811 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3811) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3812 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2024-11-13 13:00:20,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_3812 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3811 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3811) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2024-11-13 13:00:20,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3810 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3810 .cse1)) v_ArrVal_3810)) (forall ((v_ArrVal_3809 (Array Int Int))) (or (forall ((v_ArrVal_3812 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3810) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3809) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (not (= (store .cse2 .cse1 (select v_ArrVal_3809 .cse1)) v_ArrVal_3809)))))) (forall ((v_ArrVal_3810 (Array Int Int))) (or (forall ((v_ArrVal_3809 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_3809 .cse1)) v_ArrVal_3809)) (forall ((v_ArrVal_3811 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3809))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3810) .cse3 v_ArrVal_3812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_3811) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) (not (= (store .cse0 .cse1 (select v_ArrVal_3810 .cse1)) v_ArrVal_3810)))))) is different from false [2024-11-13 13:00:20,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3810 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8))) (or (forall ((v_ArrVal_3809 (Array Int Int))) (or (forall ((v_ArrVal_3811 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (let ((.cse0 (select v_ArrVal_3809 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3810) .cse0 v_ArrVal_3812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3809) .cse0 v_ArrVal_3811) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (not (= (store .cse1 .cse2 (select v_ArrVal_3809 .cse2)) v_ArrVal_3809)))) (not (= v_ArrVal_3810 (store .cse3 .cse2 (select v_ArrVal_3810 .cse2))))))))) (forall ((v_ArrVal_3810 (Array Int Int)) (v_ArrVal_3812 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_main_~s~0#1.offset|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3810) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_3810 (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8))) (store .cse3 .cse4 (select v_ArrVal_3810 .cse4))))))))) is different from false [2024-11-13 13:00:20,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (forall ((v_ArrVal_3810 (Array Int Int)) (v_ArrVal_3812 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8))) (store .cse0 .cse1 (select v_ArrVal_3810 .cse1))) v_ArrVal_3810)) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3810) (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3812) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (forall ((v_ArrVal_3810 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8))) (or (not (= (store .cse0 .cse3 (select v_ArrVal_3810 .cse3)) v_ArrVal_3810)) (forall ((v_ArrVal_3809 (Array Int Int))) (or (not (= (store .cse2 .cse3 (select v_ArrVal_3809 .cse3)) v_ArrVal_3809)) (forall ((v_ArrVal_3811 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (let ((.cse4 (select v_ArrVal_3809 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3810) .cse4 v_ArrVal_3812) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3809) .cse4 v_ArrVal_3811) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) is different from false [2024-11-13 13:00:20,681 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (forall ((v_ArrVal_3810 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8))) (or (forall ((v_ArrVal_3809 (Array Int Int))) (or (forall ((v_ArrVal_3811 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (let ((.cse0 (select v_ArrVal_3809 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3810) .cse0 v_ArrVal_3812) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3809) .cse0 v_ArrVal_3811) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_3809 (store .cse1 .cse2 (select v_ArrVal_3809 .cse2)))))) (not (= (store .cse3 .cse2 (select v_ArrVal_3810 .cse2)) v_ArrVal_3810))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_ArrVal_3810 (Array Int Int)) (v_ArrVal_3812 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (not (= (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8))) (store .cse3 .cse4 (select v_ArrVal_3810 .cse4))) v_ArrVal_3810)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3810) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3812) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2024-11-13 13:00:20,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_3810 (Array Int Int)) (v_ArrVal_3812 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8))) (store (store .cse0 .cse1 (select v_ArrVal_3810 .cse1)) .cse2 (select v_ArrVal_3810 .cse2))) v_ArrVal_3810)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3810) (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3812) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int)) (v_ArrVal_3811 (Array Int Int)) (v_ArrVal_3812 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| 8))) (or (not (= (store (store .cse0 .cse1 (select v_ArrVal_3810 .cse1)) .cse4 (select v_ArrVal_3810 .cse4)) v_ArrVal_3810)) (let ((.cse5 (select v_ArrVal_3809 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3810) .cse5 v_ArrVal_3812) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 11) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3809) .cse5 v_ArrVal_3811) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_3809 (store (store .cse3 .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 (select v_ArrVal_3809 .cse4))))))))) is different from false [2024-11-13 13:00:21,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:21,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 98 [2024-11-13 13:00:21,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 253 [2024-11-13 13:00:21,865 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:21,866 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:21,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:21,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 135 [2024-11-13 13:00:21,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:21,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:21,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 107 [2024-11-13 13:00:21,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:21,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:21,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 71 [2024-11-13 13:00:21,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:21,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-11-13 13:00:21,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 240 [2024-11-13 13:00:21,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2024-11-13 13:00:21,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2024-11-13 13:00:22,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-13 13:00:22,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 13:00:22,057 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 13:00:22,081 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 13:00:22,106 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-13 13:00:22,133 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,134 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2024-11-13 13:00:22,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 13:00:22,158 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:22,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 66 [2024-11-13 13:00:22,173 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:22,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 70 [2024-11-13 13:00:22,188 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-13 13:00:22,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 29 treesize of output 25 [2024-11-13 13:00:22,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-13 13:00:22,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-13 13:00:22,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:22,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-13 13:00:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203515801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:22,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:00:22,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 49 [2024-11-13 13:00:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569213121] [2024-11-13 13:00:22,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:22,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-13 13:00:22,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-13 13:00:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3538, Unknown=74, NotChecked=882, Total=4692 [2024-11-13 13:00:22,635 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 50 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 44 states have internal predecessors, (103), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:00:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:24,974 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-11-13 13:00:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:00:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 44 states have internal predecessors, (103), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2024-11-13 13:00:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:24,976 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:00:24,976 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 13:00:24,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=333, Invalid=5770, Unknown=87, NotChecked=1120, Total=7310 [2024-11-13 13:00:24,978 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 65 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:24,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1614 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 13:00:24,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 13:00:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-13 13:00:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.273972602739726) internal successors, (93), 88 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-13 13:00:24,982 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 57 [2024-11-13 13:00:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:24,983 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-13 13:00:24,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 44 states have internal predecessors, (103), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 13:00:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-13 13:00:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-13 13:00:24,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:24,984 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:25,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 13:00:25,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 13:00:25,188 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:25,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash -205065837, now seen corresponding path program 1 times [2024-11-13 13:00:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258058550] [2024-11-13 13:00:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:25,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 13:00:25,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:25,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258058550] [2024-11-13 13:00:25,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258058550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:25,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635549774] [2024-11-13 13:00:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:25,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:25,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:25,303 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:25,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 13:00:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:25,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:00:25,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 13:00:25,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 13:00:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635549774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:25,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:25,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-13 13:00:25,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073513066] [2024-11-13 13:00:25,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:25,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:00:25,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:25,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:00:25,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:00:25,747 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:25,858 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-13 13:00:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:00:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-11-13 13:00:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:25,859 INFO L225 Difference]: With dead ends: 92 [2024-11-13 13:00:25,859 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 13:00:25,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:00:25,860 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 30 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:25,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 360 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 13:00:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 13:00:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 88 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-13 13:00:25,864 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 60 [2024-11-13 13:00:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:25,866 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-13 13:00:25,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-13 13:00:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-13 13:00:25,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:25,867 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:25,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-13 13:00:26,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 13:00:26,067 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:26,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1150081731, now seen corresponding path program 2 times [2024-11-13 13:00:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:26,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892972954] [2024-11-13 13:00:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:26,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 13:00:26,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:26,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892972954] [2024-11-13 13:00:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892972954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993514804] [2024-11-13 13:00:26,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:00:26,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:26,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:26,217 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:26,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 13:00:26,623 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:00:26,623 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:00:26,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:00:26,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 13:00:26,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 13:00:26,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993514804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:26,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:26,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-11-13 13:00:26,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279337461] [2024-11-13 13:00:26,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:26,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:00:26,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:00:26,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:00:26,771 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 13:00:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:26,883 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2024-11-13 13:00:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:00:26,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-13 13:00:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:26,885 INFO L225 Difference]: With dead ends: 83 [2024-11-13 13:00:26,885 INFO L226 Difference]: Without dead ends: 83 [2024-11-13 13:00:26,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:00:26,886 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:26,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 329 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-13 13:00:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-13 13:00:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 79 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2024-11-13 13:00:26,889 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 60 [2024-11-13 13:00:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:26,889 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2024-11-13 13:00:26,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 13:00:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2024-11-13 13:00:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-13 13:00:26,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:26,890 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:26,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 13:00:27,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:27,091 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:27,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:27,091 INFO L85 PathProgramCache]: Analyzing trace with hash -222720643, now seen corresponding path program 1 times [2024-11-13 13:00:27,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:27,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706693777] [2024-11-13 13:00:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:29,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:29,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:00:29,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:29,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706693777] [2024-11-13 13:00:29,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706693777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:29,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185913967] [2024-11-13 13:00:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:29,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:29,406 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:29,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 13:00:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:29,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-13 13:00:29,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:29,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:30,147 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:00:30,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:00:30,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:00:30,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:00:30,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:00:30,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 13:00:30,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:30,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:30,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:30,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 24 [2024-11-13 13:00:31,165 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:31,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 70 [2024-11-13 13:00:31,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 13:00:31,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:31,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-11-13 13:00:31,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-13 13:00:31,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-13 13:00:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:32,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:32,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2024-11-13 13:00:32,544 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4401 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4401) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_4399 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4399) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2024-11-13 13:00:32,566 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4399 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4399) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_4401 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4401) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2024-11-13 13:00:32,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:32,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2024-11-13 13:00:32,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-13 13:00:32,902 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4398 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4398) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= v_ArrVal_4398 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_4398 .cse0))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2024-11-13 13:00:33,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4396 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4396) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-13 13:00:33,279 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4395 (Array Int Int)) (v_ArrVal_4396 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4395) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4396) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-13 13:00:33,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:33,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-13 13:00:33,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2024-11-13 13:00:33,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 13:00:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 13:00:33,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 13:00:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-13 13:00:34,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185913967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:34,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:34,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32, 31] total 89 [2024-11-13 13:00:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131376594] [2024-11-13 13:00:34,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:34,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2024-11-13 13:00:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:34,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2024-11-13 13:00:34,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=6678, Unknown=30, NotChecked=840, Total=7832 [2024-11-13 13:00:34,050 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 89 states, 87 states have (on average 1.8160919540229885) internal successors, (158), 80 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:00:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:38,153 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2024-11-13 13:00:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 13:00:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 87 states have (on average 1.8160919540229885) internal successors, (158), 80 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2024-11-13 13:00:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:38,155 INFO L225 Difference]: With dead ends: 79 [2024-11-13 13:00:38,155 INFO L226 Difference]: Without dead ends: 79 [2024-11-13 13:00:38,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3070 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=589, Invalid=11610, Unknown=31, NotChecked=1110, Total=13340 [2024-11-13 13:00:38,159 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 86 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:38,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1963 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2089 Invalid, 0 Unknown, 257 Unchecked, 1.7s Time] [2024-11-13 13:00:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-13 13:00:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-13 13:00:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 75 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2024-11-13 13:00:38,162 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 63 [2024-11-13 13:00:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:38,162 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2024-11-13 13:00:38,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 87 states have (on average 1.8160919540229885) internal successors, (158), 80 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:00:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2024-11-13 13:00:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-13 13:00:38,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:38,164 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:38,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 13:00:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:38,364 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:38,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1685252285, now seen corresponding path program 1 times [2024-11-13 13:00:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:38,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29045909] [2024-11-13 13:00:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 13:00:38,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29045909] [2024-11-13 13:00:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29045909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:38,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:38,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:00:38,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534990079] [2024-11-13 13:00:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:38,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:00:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:38,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:00:38,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:38,632 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:38,883 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-13 13:00:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:00:38,884 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2024-11-13 13:00:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:38,884 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:00:38,884 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 13:00:38,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:38,885 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:38,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 283 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:00:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 13:00:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2024-11-13 13:00:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-13 13:00:38,893 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 64 [2024-11-13 13:00:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:38,893 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-13 13:00:38,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-13 13:00:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-13 13:00:38,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:38,895 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:38,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 13:00:38,895 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:38,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1685252286, now seen corresponding path program 1 times [2024-11-13 13:00:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:38,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512432705] [2024-11-13 13:00:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:38,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:39,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:00:39,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:39,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512432705] [2024-11-13 13:00:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512432705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:39,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:00:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354444191] [2024-11-13 13:00:39,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:39,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:00:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:00:39,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:39,356 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:39,567 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-13 13:00:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:00:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2024-11-13 13:00:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:39,568 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:00:39,569 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 13:00:39,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:39,569 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:39,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 317 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:00:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 13:00:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-13 13:00:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-13 13:00:39,576 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 64 [2024-11-13 13:00:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:39,577 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-13 13:00:39,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-13 13:00:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 13:00:39,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:39,578 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:39,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 13:00:39,578 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:39,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash 703246179, now seen corresponding path program 1 times [2024-11-13 13:00:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:39,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528292319] [2024-11-13 13:00:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:39,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:39,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:00:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:39,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528292319] [2024-11-13 13:00:39,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528292319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:39,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:39,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 13:00:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931427808] [2024-11-13 13:00:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:39,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:00:39,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:39,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:00:39,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:39,783 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:39,944 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-13 13:00:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:00:39,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-11-13 13:00:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:39,945 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:00:39,945 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 13:00:39,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:39,946 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 17 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:39,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 365 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:00:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 13:00:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-13 13:00:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.144927536231884) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-13 13:00:39,949 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 65 [2024-11-13 13:00:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:39,949 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-13 13:00:39,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:00:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-13 13:00:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:00:39,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:39,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:39,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 13:00:39,950 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:39,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:39,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1478185146, now seen corresponding path program 1 times [2024-11-13 13:00:39,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:39,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808746016] [2024-11-13 13:00:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:40,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:40,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 13:00:40,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:40,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808746016] [2024-11-13 13:00:40,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808746016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:40,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244819385] [2024-11-13 13:00:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:40,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:40,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:40,226 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:40,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 13:00:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:40,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-13 13:00:40,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:40,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:40,807 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:00:40,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:00:40,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:00:40,918 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:40,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-13 13:00:41,010 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:00:41,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 13:00:41,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 13:00:41,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:41,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:41,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:41,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-13 13:00:41,544 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:41,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2024-11-13 13:00:41,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:41,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-11-13 13:00:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 13:00:41,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:41,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4952 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4952) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-13 13:00:41,910 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4952 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4952) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-13 13:00:41,921 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4952 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4951))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4952)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_4951 (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_4951 .cse1))))))) is different from false [2024-11-13 13:00:41,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4952 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= v_ArrVal_4951 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_4951 .cse0))))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_4951) (select v_ArrVal_4951 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4952) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-13 13:00:41,949 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4952 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| Int)) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_4951) (select v_ArrVal_4951 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (= v_ArrVal_4951 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_4951 .cse0))))))) is different from false [2024-11-13 13:00:41,974 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4952 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_4951 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_4951 .cse0))))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4951) (select v_ArrVal_4951 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-13 13:00:41,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4952 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4951) (select v_ArrVal_4951 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| 8))) (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_4951 .cse0))) v_ArrVal_4951)))) is different from false [2024-11-13 13:00:42,012 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-13 13:00:42,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-13 13:00:42,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4952 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| Int) (v_ArrVal_4948 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4948))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_4951 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_4951 .cse1))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4951) (select v_ArrVal_4951 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2024-11-13 13:00:42,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4951 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| Int) (v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4948 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4948))) (or (not (= v_ArrVal_4951 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_4951 .cse1))))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4951) (select v_ArrVal_4951 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-13 13:00:42,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4951 (Array Int Int)) (v_ArrVal_4952 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| Int) (v_ArrVal_4947 (Array Int Int)) (v_ArrVal_4948 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4947) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4948))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4951) (select v_ArrVal_4951 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_4951 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_4951 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_72| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-13 13:00:42,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:42,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2024-11-13 13:00:42,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 109 [2024-11-13 13:00:42,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:42,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:42,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2024-11-13 13:00:42,133 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:42,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:42,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 81 [2024-11-13 13:00:42,148 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:42,148 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:42,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:42,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 77 [2024-11-13 13:00:42,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-13 13:00:42,273 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:42,274 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:42,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 123 [2024-11-13 13:00:42,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:42,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:00:42,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 70 [2024-11-13 13:00:42,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:00:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244819385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:42,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:00:42,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24] total 30 [2024-11-13 13:00:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645461418] [2024-11-13 13:00:42,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:42,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-13 13:00:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-13 13:00:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1024, Unknown=35, NotChecked=730, Total=1892 [2024-11-13 13:00:42,419 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 27 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 13:00:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:43,254 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-13 13:00:43,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 13:00:43,254 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 27 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2024-11-13 13:00:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:43,255 INFO L225 Difference]: With dead ends: 87 [2024-11-13 13:00:43,255 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 13:00:43,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=1506, Unknown=38, NotChecked=870, Total=2550 [2024-11-13 13:00:43,256 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:43,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 647 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:00:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 13:00:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-13 13:00:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:00:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-13 13:00:43,258 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 67 [2024-11-13 13:00:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:43,259 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-13 13:00:43,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 27 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 13:00:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-13 13:00:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:00:43,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:43,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:43,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-13 13:00:43,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-13 13:00:43,460 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:00:43,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1478185147, now seen corresponding path program 1 times [2024-11-13 13:00:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:43,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3440745] [2024-11-13 13:00:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:43,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:00:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:00:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:00:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3440745] [2024-11-13 13:00:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3440745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266334843] [2024-11-13 13:00:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:45,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:45,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:45,008 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:45,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 13:00:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:45,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-13 13:00:45,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:45,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:45,632 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:00:45,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:00:45,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:00:45,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:00:45,905 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:45,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-13 13:00:45,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:00:46,077 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:00:46,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 13:00:46,094 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:00:46,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:00:46,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:00:46,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:00:46,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:46,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:46,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2024-11-13 13:00:46,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:46,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 13:00:46,854 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:00:46,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 52 [2024-11-13 13:00:46,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:00:47,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-13 13:00:47,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:00:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 13:00:47,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:01:00,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:00,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 181 [2024-11-13 13:01:01,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:01,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2024-11-13 13:01:01,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 221 [2024-11-13 13:01:01,550 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:01,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2024-11-13 13:01:01,589 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:01,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2024-11-13 13:01:01,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:01,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2024-11-13 13:01:01,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-13 13:01:01,781 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2024-11-13 13:01:01,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,847 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 56 [2024-11-13 13:01:01,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:01:01,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:01,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 98 [2024-11-13 13:01:01,905 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-13 13:01:01,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:01,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2024-11-13 13:01:01,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 36 treesize of output 24 [2024-11-13 13:01:01,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,950 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:01,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-13 13:01:01,975 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 13:01:01,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2024-11-13 13:01:02,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266334843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:02,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:01:02,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 48 [2024-11-13 13:01:02,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30774533] [2024-11-13 13:01:02,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:01:02,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-13 13:01:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-13 13:01:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=4283, Unknown=29, NotChecked=0, Total=4556 [2024-11-13 13:01:02,843 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 49 states, 48 states have (on average 2.2291666666666665) internal successors, (107), 44 states have internal predecessors, (107), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:01:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:06,538 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-13 13:01:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 13:01:06,539 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.2291666666666665) internal successors, (107), 44 states have internal predecessors, (107), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 67 [2024-11-13 13:01:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:06,540 INFO L225 Difference]: With dead ends: 82 [2024-11-13 13:01:06,540 INFO L226 Difference]: Without dead ends: 82 [2024-11-13 13:01:06,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=302, Invalid=5219, Unknown=29, NotChecked=0, Total=5550 [2024-11-13 13:01:06,541 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 41 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:06,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 939 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 13:01:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-13 13:01:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-13 13:01:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.125) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:01:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-13 13:01:06,545 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 67 [2024-11-13 13:01:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:06,545 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-13 13:01:06,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.2291666666666665) internal successors, (107), 44 states have internal predecessors, (107), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:01:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-13 13:01:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 13:01:06,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:06,546 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:06,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-13 13:01:06,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 13:01:06,747 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:01:06,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1420902109, now seen corresponding path program 1 times [2024-11-13 13:01:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670420539] [2024-11-13 13:01:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:01:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:01:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 13:01:07,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:07,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670420539] [2024-11-13 13:01:07,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670420539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:07,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:07,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:01:07,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321383101] [2024-11-13 13:01:07,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:07,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:01:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:07,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:01:07,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:01:07,189 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:01:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:07,792 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2024-11-13 13:01:07,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:01:07,793 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-13 13:01:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:07,794 INFO L225 Difference]: With dead ends: 81 [2024-11-13 13:01:07,794 INFO L226 Difference]: Without dead ends: 81 [2024-11-13 13:01:07,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:01:07,795 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:07,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 316 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:01:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-13 13:01:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-13 13:01:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:01:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2024-11-13 13:01:07,798 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 68 [2024-11-13 13:01:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:07,799 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2024-11-13 13:01:07,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 13:01:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2024-11-13 13:01:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 13:01:07,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:07,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:07,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 13:01:07,800 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:01:07,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash 314095976, now seen corresponding path program 1 times [2024-11-13 13:01:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:07,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054484602] [2024-11-13 13:01:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:09,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:01:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:10,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:01:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:01:10,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:10,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054484602] [2024-11-13 13:01:10,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054484602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:10,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078675341] [2024-11-13 13:01:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:10,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:10,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:10,577 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:01:10,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 13:01:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:11,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-13 13:01:11,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:11,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:01:11,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 13:01:11,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:01:11,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:01:11,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:12,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:01:12,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:01:12,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 13:01:13,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:13,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:13,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:13,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2024-11-13 13:01:14,027 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:01:14,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 42 [2024-11-13 13:01:14,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:14,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-13 13:01:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 13:01:14,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:01:18,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:18,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2024-11-13 13:01:18,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 221 [2024-11-13 13:01:18,979 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:18,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:18,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 109 [2024-11-13 13:01:19,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:19,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:19,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:19,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 105 [2024-11-13 13:01:19,044 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:19,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:19,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2024-11-13 13:01:19,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-13 13:01:19,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:19,248 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:19,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2024-11-13 13:01:19,343 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:19,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:19,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 76 [2024-11-13 13:01:19,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2024-11-13 13:01:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078675341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:20,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:01:20,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 45 [2024-11-13 13:01:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565514956] [2024-11-13 13:01:20,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:01:20,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-13 13:01:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-13 13:01:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3768, Unknown=27, NotChecked=0, Total=4032 [2024-11-13 13:01:20,341 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 41 states have internal predecessors, (111), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:01:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:25,432 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2024-11-13 13:01:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 13:01:25,432 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 41 states have internal predecessors, (111), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 70 [2024-11-13 13:01:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:25,433 INFO L225 Difference]: With dead ends: 82 [2024-11-13 13:01:25,433 INFO L226 Difference]: Without dead ends: 82 [2024-11-13 13:01:25,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=380, Invalid=6073, Unknown=27, NotChecked=0, Total=6480 [2024-11-13 13:01:25,434 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:25,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 736 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 13:01:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-13 13:01:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-13 13:01:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.095890410958904) internal successors, (80), 78 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:01:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2024-11-13 13:01:25,437 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 70 [2024-11-13 13:01:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:25,437 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2024-11-13 13:01:25,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 41 states have internal predecessors, (111), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 13:01:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2024-11-13 13:01:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 13:01:25,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:25,438 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:25,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-13 13:01:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-13 13:01:25,639 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:01:25,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1103112088, now seen corresponding path program 1 times [2024-11-13 13:01:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:25,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698407548] [2024-11-13 13:01:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:01:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:27,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:01:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 13:01:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:28,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698407548] [2024-11-13 13:01:28,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698407548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:28,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806835534] [2024-11-13 13:01:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:28,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:28,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:28,020 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:01:28,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-13 13:01:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:28,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-13 13:01:28,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:28,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:01:28,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:01:28,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:01:29,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:29,304 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:01:29,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-13 13:01:29,599 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:01:29,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 13:01:29,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-13 13:01:30,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:30,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:30,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:30,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2024-11-13 13:01:30,792 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:01:30,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2024-11-13 13:01:31,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:31,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2024-11-13 13:01:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 13:01:31,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:01:32,917 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_5679) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2024-11-13 13:01:32,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5679) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2024-11-13 13:01:32,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5679) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2024-11-13 13:01:32,968 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5678 (Array Int Int))) (or (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_5678 .cse0))) v_ArrVal_5678)) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5678))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5679)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2024-11-13 13:01:33,009 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_5678 .cse0))) v_ArrVal_5678)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5678) (select v_ArrVal_5678 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5679) |c_ULTIMATE.start_main_~s~0#1.base|) 0))))) is different from false [2024-11-13 13:01:33,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| Int)) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_5678 .cse0))) v_ArrVal_5678)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5678) (select v_ArrVal_5678 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5679) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2024-11-13 13:01:33,063 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5678) (select v_ArrVal_5678 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5679) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| 8))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_5678 .cse0))) v_ArrVal_5678)))) is different from false [2024-11-13 13:01:33,098 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| Int) (v_ArrVal_5678 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5678) (select v_ArrVal_5678 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5679) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| 8))) (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_5678 .cse0))) v_ArrVal_5678)))) is different from false [2024-11-13 13:01:33,143 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5679 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| Int) (v_ArrVal_5678 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5676))) (or (not (= v_ArrVal_5678 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_5678 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5678) (select v_ArrVal_5678 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5679) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2024-11-13 13:01:33,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5679 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| Int) (v_ArrVal_5678 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5676))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_5678 .cse1))) v_ArrVal_5678)) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5678) (select v_ArrVal_5678 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5679) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-13 13:01:33,264 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5675 (Array Int Int)) (v_ArrVal_5676 (Array Int Int)) (v_ArrVal_5679 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| Int) (v_ArrVal_5678 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5675) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5676))) (or (not (= v_ArrVal_5678 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_5678 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_93| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5678) (select v_ArrVal_5678 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5679) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))))) is different from false [2024-11-13 13:01:33,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:33,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2024-11-13 13:01:33,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 109 [2024-11-13 13:01:33,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:33,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:33,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:33,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2024-11-13 13:01:33,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:33,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:33,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2024-11-13 13:01:33,439 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:33,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:33,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2024-11-13 13:01:33,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-13 13:01:33,681 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:33,683 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:33,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:33,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 186 [2024-11-13 13:01:34,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:34,233 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:34,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:34,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 211 [2024-11-13 13:01:35,071 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:35,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:35,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:35,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 164 [2024-11-13 13:01:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 9 not checked. [2024-11-13 13:01:37,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806835534] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:01:37,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:01:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 28] total 71 [2024-11-13 13:01:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921875324] [2024-11-13 13:01:37,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:01:37,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-13 13:01:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:37,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-13 13:01:37,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3354, Unknown=22, NotChecked=1386, Total=4970 [2024-11-13 13:01:37,422 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 71 states, 71 states have (on average 2.267605633802817) internal successors, (161), 63 states have internal predecessors, (161), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 13:01:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:43,199 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2024-11-13 13:01:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 13:01:43,199 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.267605633802817) internal successors, (161), 63 states have internal predecessors, (161), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 71 [2024-11-13 13:01:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:43,200 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:01:43,200 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 13:01:43,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=306, Invalid=4828, Unknown=22, NotChecked=1650, Total=6806 [2024-11-13 13:01:43,201 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 120 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 746 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:43,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1012 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1434 Invalid, 0 Unknown, 746 Unchecked, 3.5s Time] [2024-11-13 13:01:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 13:01:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-13 13:01:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 75 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 13:01:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2024-11-13 13:01:43,205 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 71 [2024-11-13 13:01:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:43,205 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2024-11-13 13:01:43,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.267605633802817) internal successors, (161), 63 states have internal predecessors, (161), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 13:01:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2024-11-13 13:01:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 13:01:43,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:43,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:43,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-13 13:01:43,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-13 13:01:43,407 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-13 13:01:43,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1500354433, now seen corresponding path program 1 times [2024-11-13 13:01:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:43,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386970998] [2024-11-13 13:01:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:46,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:01:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:01:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:01:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386970998] [2024-11-13 13:01:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386970998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570254427] [2024-11-13 13:01:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:47,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:47,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:47,356 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:01:47,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0479dd-7148-46a2-941c-a66c593b6ca8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-13 13:01:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:47,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-13 13:01:47,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:47,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:01:48,641 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:01:48,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:01:48,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:49,207 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:01:49,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-13 13:01:49,637 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 13:01:49,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-13 13:01:49,874 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 13:01:49,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 34 [2024-11-13 13:01:50,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:50,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:50,763 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2024-11-13 13:01:50,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 37 [2024-11-13 13:01:51,707 INFO L349 Elim1Store]: treesize reduction 116, result has 20.5 percent of original size [2024-11-13 13:01:51,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 66 [2024-11-13 13:01:51,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2024-11-13 13:01:52,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-13 13:01:54,328 INFO L349 Elim1Store]: treesize reduction 40, result has 69.0 percent of original size [2024-11-13 13:01:54,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 95 treesize of output 141 [2024-11-13 13:01:57,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:01:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 13:01:57,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:02:01,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:02:01,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2024-11-13 13:02:01,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-13 13:02:01,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:02:01,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 324 [2024-11-13 13:05:28,854 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 177 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:10:21,949 WARN L873 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse17 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (or (forall ((v_prenex_26 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int))) (let ((.cse1 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse2 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse6 (store .cse1 .cse2 v_prenex_25))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse4 (select (select .cse6 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0))) (or (< v_prenex_26 0) (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (let ((.cse3 (+ v_prenex_26 8))) (store (select .cse1 .cse2) .cse3 (select v_prenex_25 .cse3))) v_prenex_25)) (= .cse4 (select (let ((.cse5 (store .cse1 .cse2 v_ArrVal_5885))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (not (= (let ((.cse9 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse9 (select v_ArrVal_5883 .cse9))) v_ArrVal_5883)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse12 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_5885 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_5885))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0))) (not (= (let ((.cse13 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse13 (select v_ArrVal_5883 .cse13))) v_ArrVal_5883)) (forall ((v_prenex_26 Int) (v_prenex_25 (Array Int Int))) (let ((.cse16 (store .cse11 .cse12 v_prenex_25))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (not (= v_prenex_25 (let ((.cse14 (+ v_prenex_26 8))) (store v_ArrVal_5883 .cse14 (select v_prenex_25 .cse14))))) (= (select .cse15 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse16 (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (not (= .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (or .cse17 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse19 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse20 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse18 (select (let ((.cse25 (store .cse19 .cse20 v_ArrVal_5885))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (.cse23 (select (let ((.cse24 (store .cse19 .cse20 v_prenex_25))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse18) (not (= v_ArrVal_5885 (let ((.cse21 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store (select .cse19 .cse20) .cse21 (select v_ArrVal_5885 .cse21))))) (not (= (let ((.cse22 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse22 (select v_ArrVal_5883 .cse22))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse23 .cse18) (= .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (or .cse17 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse30 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse31 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse32 (select (let ((.cse34 (store .cse30 .cse31 v_prenex_25))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0))) (or (not (= v_prenex_23 (let ((.cse26 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse26 (select v_prenex_23 .cse26))))) (not (= (let ((.cse27 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse27 (select v_ArrVal_5883 .cse27))) v_ArrVal_5883)) (not (let ((.cse29 (store .cse30 .cse31 v_prenex_23))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse28 (select (select .cse29 .cse28) 0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse32 (select (let ((.cse33 (store .cse30 .cse31 v_ArrVal_5885))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (= .cse32 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse36 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse37 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse35 (select (let ((.cse41 (store .cse36 .cse37 v_ArrVal_5885))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse35) (not (= v_ArrVal_5885 (let ((.cse38 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store (select .cse36 .cse37) .cse38 (select v_ArrVal_5885 .cse38))))) (not (= (let ((.cse39 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse39 (select v_ArrVal_5883 .cse39))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse40 (store .cse36 .cse37 v_prenex_25))) (select .cse40 (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0) .cse35))))) .cse17) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse45 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse46 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse47 (select (let ((.cse50 (store .cse45 .cse46 v_prenex_25))) (select .cse50 (select (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0))) (or (not (= (let ((.cse42 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse42 (select v_ArrVal_5883 .cse42))) v_ArrVal_5883)) (< v_prenex_24 0) (not (let ((.cse44 (store .cse45 .cse46 v_prenex_23))) (let ((.cse43 (select (select .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse43 (select (select .cse44 .cse43) 0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse47 (select (let ((.cse48 (store .cse45 .cse46 v_ArrVal_5885))) (select .cse48 (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (not (= (let ((.cse49 (+ v_prenex_24 8))) (store (select .cse45 .cse46) .cse49 (select v_prenex_23 .cse49))) v_prenex_23)) (= .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse17) (or .cse17 (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse54 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse55 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= (let ((.cse51 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse51 (select v_ArrVal_5883 .cse51))) v_ArrVal_5883)) (< v_prenex_24 0) (not (let ((.cse53 (store .cse54 .cse55 v_prenex_23))) (let ((.cse52 (select (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse52 (select (select .cse53 .cse52) 0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse56 (store .cse54 .cse55 v_prenex_25))) (select .cse56 (select (select .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0) (select (let ((.cse57 (store .cse54 .cse55 v_ArrVal_5885))) (select .cse57 (select (select .cse57 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (not (= (let ((.cse58 (+ v_prenex_24 8))) (store (select .cse54 .cse55) .cse58 (select v_prenex_23 .cse58))) v_prenex_23)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse65 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= (let ((.cse59 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse59 (select v_ArrVal_5883 .cse59))) v_ArrVal_5883)) (forall ((v_prenex_26 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int))) (let ((.cse64 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883))) (let ((.cse66 (store .cse64 .cse65 v_prenex_25))) (let ((.cse61 (select .cse66 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse62 (select (select .cse66 (select .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0))) (or (not (= v_prenex_25 (let ((.cse60 (+ v_prenex_26 8))) (store v_ArrVal_5883 .cse60 (select v_prenex_25 .cse60))))) (= (select .cse61 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse62 (select (let ((.cse63 (store .cse64 .cse65 v_ArrVal_5885))) (select .cse63 (select (select .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (= .cse62 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (not (= .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (or .cse17 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse73 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse71 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse68 (select (let ((.cse74 (store .cse73 .cse71 v_ArrVal_5885))) (select .cse74 (select (select .cse74 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (.cse70 (select (let ((.cse72 (store .cse73 .cse71 v_prenex_25))) (select .cse72 (select (select .cse72 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0))) (or (not (= v_ArrVal_5885 (let ((.cse67 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store v_ArrVal_5883 .cse67 (select v_ArrVal_5885 .cse67))))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse68) (not (= (let ((.cse69 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse69 (select v_ArrVal_5883 .cse69))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse70 .cse68) (= .cse70 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse71 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (or .cse17 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse77 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse78 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_ArrVal_5885 (let ((.cse75 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store v_ArrVal_5883 .cse75 (select v_ArrVal_5885 .cse75))))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse76 (store .cse77 .cse78 v_ArrVal_5885))) (select .cse76 (select (select .cse76 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (not (= (let ((.cse79 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse79 (select v_ArrVal_5883 .cse79))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse80 (store .cse77 .cse78 v_prenex_25))) (select .cse80 (select (select .cse80 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse78 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (or (not (= (let ((.cse81 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse81 (select v_ArrVal_5883 .cse81))) v_ArrVal_5883)) (forall ((v_prenex_28 Int) (v_prenex_27 (Array Int Int))) (let ((.cse85 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse86 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse83 (store .cse85 .cse86 v_prenex_27))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (not (let ((.cse82 (select .cse84 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse82 (select (select .cse83 .cse82) 0)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse84 0)) (< v_prenex_28 0) (not (= v_prenex_27 (let ((.cse87 (+ v_prenex_28 8))) (store (select .cse85 .cse86) .cse87 (select v_prenex_27 .cse87)))))))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse92 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse93 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_prenex_23 (let ((.cse88 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse88 (select v_prenex_23 .cse88))))) (not (= (let ((.cse89 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse89 (select v_ArrVal_5883 .cse89))) v_ArrVal_5883)) (not (let ((.cse91 (store .cse92 .cse93 v_prenex_23))) (let ((.cse90 (select (select .cse91 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse90 (select (select .cse91 .cse90) 0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse94 (store .cse92 .cse93 v_prenex_25))) (select .cse94 (select (select .cse94 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse93 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse17) (or .cse17 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse99 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse100 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse96 (select (let ((.cse101 (store .cse99 .cse100 v_ArrVal_5885))) (select .cse101 (select (select .cse101 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0))) (or (not (= v_ArrVal_5885 (let ((.cse95 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store v_ArrVal_5883 .cse95 (select v_ArrVal_5885 .cse95))))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse96) (not (= (let ((.cse97 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse97 (select v_ArrVal_5883 .cse97))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse98 (store .cse99 .cse100 v_prenex_25))) (select .cse98 (select (select .cse98 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0) .cse96) (not (= .cse100 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (or .cse17 (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse105 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse106 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= (let ((.cse102 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse102 (select v_ArrVal_5883 .cse102))) v_ArrVal_5883)) (< v_prenex_24 0) (not (let ((.cse104 (store .cse105 .cse106 v_prenex_23))) (let ((.cse103 (select (select .cse104 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse103 (select (select .cse104 .cse103) 0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (let ((.cse107 (+ v_prenex_24 8))) (store (select .cse105 .cse106) .cse107 (select v_prenex_23 .cse107))) v_prenex_23)))))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse111 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse112 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= (let ((.cse108 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse108 (select v_ArrVal_5883 .cse108))) v_ArrVal_5883)) (< v_prenex_24 0) (not (let ((.cse110 (store .cse111 .cse112 v_prenex_23))) (let ((.cse109 (select (select .cse110 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse109 (select (select .cse110 .cse109) 0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (let ((.cse113 (+ v_prenex_24 8))) (store (select .cse111 .cse112) .cse113 (select v_prenex_23 .cse113))) v_prenex_23)) (= (select (let ((.cse114 (store .cse111 .cse112 v_prenex_25))) (select .cse114 (select (select .cse114 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) .cse17) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse116 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse117 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_5885 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse115 (store .cse116 .cse117 v_ArrVal_5885))) (select .cse115 (select (select .cse115 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0))) (not (= (let ((.cse118 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse118 (select v_ArrVal_5883 .cse118))) v_ArrVal_5883)) (forall ((v_prenex_26 Int) (v_prenex_25 (Array Int Int))) (let ((.cse121 (store .cse116 .cse117 v_prenex_25))) (let ((.cse119 (select .cse121 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (< v_prenex_26 0) (= (select .cse119 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (let ((.cse120 (+ v_prenex_26 8))) (store (select .cse116 .cse117) .cse120 (select v_prenex_25 .cse120))) v_prenex_25)) (= (select (select .cse121 (select .cse119 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse127 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= (let ((.cse122 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse122 (select v_ArrVal_5883 .cse122))) v_ArrVal_5883)) (forall ((v_prenex_28 Int) (v_prenex_27 (Array Int Int))) (let ((.cse125 (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883) .cse127 v_prenex_27))) (let ((.cse126 (select .cse125 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (not (= v_prenex_27 (let ((.cse123 (+ v_prenex_28 8))) (store v_ArrVal_5883 .cse123 (select v_prenex_27 .cse123))))) (not (let ((.cse124 (select .cse126 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse124 (select (select .cse125 .cse124) 0)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse126 0)))))) (not (= .cse127 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse132 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse133 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_prenex_23 (let ((.cse128 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse128 (select v_prenex_23 .cse128))))) (not (= (let ((.cse129 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse129 (select v_ArrVal_5883 .cse129))) v_ArrVal_5883)) (not (let ((.cse131 (store .cse132 .cse133 v_prenex_23))) (let ((.cse130 (select (select .cse131 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse130 (select (select .cse131 .cse130) 0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse134 (store .cse132 .cse133 v_prenex_25))) (select .cse134 (select (select .cse134 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0) (select (let ((.cse135 (store .cse132 .cse133 v_ArrVal_5885))) (select .cse135 (select (select .cse135 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (not (= .cse133 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse17) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse137 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883)) (.cse138 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse136 (store .cse137 .cse138 v_ArrVal_5885))) (select .cse136 (select (select .cse136 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (not (= v_ArrVal_5885 (let ((.cse139 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store (select .cse137 .cse138) .cse139 (select v_ArrVal_5885 .cse139))))) (not (= (let ((.cse140 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse140 (select v_ArrVal_5883 .cse140))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse141 (store .cse137 .cse138 v_prenex_25))) (select .cse141 (select (select .cse141 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) .cse17) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse146 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= v_prenex_23 (let ((.cse142 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse142 (select v_prenex_23 .cse142))))) (not (= (let ((.cse143 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse8 .cse143 (select v_ArrVal_5883 .cse143))) v_ArrVal_5883)) (not (let ((.cse145 (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5883) .cse146 v_prenex_23))) (let ((.cse144 (select (select .cse145 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse144 (select (select .cse145 .cse144) 0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= .cse146 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse17))))) is different from true [2024-11-13 13:10:30,105 WARN L873 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse5 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse3 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (let ((.cse1 (store .cse2 .cse3 v_prenex_25))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_ArrVal_5885 (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store v_ArrVal_5883 .cse4 (select v_ArrVal_5885 .cse4))))) (not (= (let ((.cse6 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse6 (select v_ArrVal_5883 .cse6))) v_ArrVal_5883)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (let ((.cse7 (store .cse2 .cse3 v_ArrVal_5885))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse13 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_28 Int) (v_prenex_27 (Array Int Int))) (let ((.cse10 (store (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883) .cse13 v_prenex_27))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (not (let ((.cse9 (select .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse9 (select (select .cse10 .cse9) 0)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select .cse11 0)) (not (= v_prenex_27 (let ((.cse12 (+ v_prenex_28 8))) (store v_ArrVal_5883 .cse12 (select v_prenex_27 .cse12))))))))) (not (= (let ((.cse14 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse14 (select v_ArrVal_5883 .cse14))) v_ArrVal_5883)) (not (= .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse16 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse17 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (let ((.cse15 (store .cse16 .cse17 v_prenex_25))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 0) (not (= (let ((.cse18 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store (select .cse16 .cse17) .cse18 (select v_ArrVal_5885 .cse18))) v_ArrVal_5885)) (not (= (let ((.cse19 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse19 (select v_ArrVal_5883 .cse19))) v_ArrVal_5883)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (let ((.cse20 (store .cse16 .cse17 v_ArrVal_5885))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse23 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse24 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse21 (select (let ((.cse28 (store .cse23 .cse24 v_prenex_25))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (.cse22 (select (let ((.cse27 (store .cse23 .cse24 v_ArrVal_5885))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (= .cse21 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse21 .cse22) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 0) (not (= (let ((.cse25 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store (select .cse23 .cse24) .cse25 (select v_ArrVal_5885 .cse25))) v_ArrVal_5885)) (not (= (let ((.cse26 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse26 (select v_ArrVal_5883 .cse26))) v_ArrVal_5883)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse22) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse31 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse32 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse29 (select (let ((.cse37 (store .cse31 .cse32 v_prenex_25))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (= .cse29 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse29 (select (let ((.cse30 (store .cse31 .cse32 v_ArrVal_5885))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (not (= v_prenex_23 (let ((.cse33 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse33 (select v_prenex_23 .cse33))))) (not (let ((.cse34 (store .cse31 .cse32 v_prenex_23))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse34 .cse35) 0) .cse35)))) (not (= (let ((.cse36 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse36 (select v_ArrVal_5883 .cse36))) v_ArrVal_5883)) (not (= .cse32 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse39 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse40 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse41 (select (let ((.cse44 (store .cse39 .cse40 v_ArrVal_5885))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (= (select (let ((.cse38 (store .cse39 .cse40 v_prenex_25))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) .cse41) (not (= v_ArrVal_5885 (let ((.cse42 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store v_ArrVal_5883 .cse42 (select v_ArrVal_5885 .cse42))))) (not (= (let ((.cse43 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse43 (select v_ArrVal_5883 .cse43))) v_ArrVal_5883)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse41) (not (= .cse40 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse0) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse46 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse47 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (let ((.cse45 (store .cse46 .cse47 v_prenex_25))) (select .cse45 (select (select .cse45 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) (select (let ((.cse48 (store .cse46 .cse47 v_ArrVal_5885))) (select .cse48 (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (< v_prenex_24 0) (not (let ((.cse49 (store .cse46 .cse47 v_prenex_23))) (let ((.cse50 (select (select .cse49 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse49 .cse50) 0) .cse50)))) (not (= v_prenex_23 (let ((.cse51 (+ v_prenex_24 8))) (store (select .cse46 .cse47) .cse51 (select v_prenex_23 .cse51))))) (not (= (let ((.cse52 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse52 (select v_ArrVal_5883 .cse52))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse0) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse55 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse56 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (< v_prenex_24 0) (not (let ((.cse53 (store .cse55 .cse56 v_prenex_23))) (let ((.cse54 (select (select .cse53 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse53 .cse54) 0) .cse54)))) (not (= v_prenex_23 (let ((.cse57 (+ v_prenex_24 8))) (store (select .cse55 .cse56) .cse57 (select v_prenex_23 .cse57))))) (not (= (let ((.cse58 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse58 (select v_ArrVal_5883 .cse58))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse60 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse61 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (let ((.cse59 (store .cse60 .cse61 v_prenex_25))) (select .cse59 (select (select .cse59 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_24 0) (not (let ((.cse62 (store .cse60 .cse61 v_prenex_23))) (let ((.cse63 (select (select .cse62 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse62 .cse63) 0) .cse63)))) (not (= v_prenex_23 (let ((.cse64 (+ v_prenex_24 8))) (store (select .cse60 .cse61) .cse64 (select v_prenex_23 .cse64))))) (not (= (let ((.cse65 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse65 (select v_ArrVal_5883 .cse65))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse67 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse68 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (let ((.cse66 (store .cse67 .cse68 v_prenex_25))) (select .cse66 (select (select .cse66 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) (select (let ((.cse69 (store .cse67 .cse68 v_ArrVal_5885))) (select .cse69 (select (select .cse69 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (not (= v_prenex_23 (let ((.cse70 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse70 (select v_prenex_23 .cse70))))) (not (let ((.cse71 (store .cse67 .cse68 v_prenex_23))) (let ((.cse72 (select (select .cse71 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse71 .cse72) 0) .cse72)))) (not (= (let ((.cse73 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse73 (select v_ArrVal_5883 .cse73))) v_ArrVal_5883)) (not (= .cse68 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse78 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= (let ((.cse74 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse74 (select v_ArrVal_5883 .cse74))) v_ArrVal_5883)) (forall ((v_prenex_26 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int))) (let ((.cse77 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883))) (let ((.cse81 (store .cse77 .cse78 v_prenex_25))) (let ((.cse79 (select .cse81 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse75 (select (select .cse81 (select .cse79 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0))) (or (= .cse75 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse75 (select (let ((.cse76 (store .cse77 .cse78 v_ArrVal_5885))) (select .cse76 (select (select .cse76 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (= (select .cse79 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_25 (let ((.cse80 (+ v_prenex_26 8))) (store v_ArrVal_5883 .cse80 (select v_prenex_25 .cse80))))))))))) (not (= .cse78 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse88 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse86 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse82 (select (let ((.cse89 (store .cse88 .cse86 v_prenex_25))) (select .cse89 (select (select .cse89 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (.cse83 (select (let ((.cse87 (store .cse88 .cse86 v_ArrVal_5885))) (select .cse87 (select (select .cse87 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (= .cse82 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse82 .cse83) (not (= v_ArrVal_5885 (let ((.cse84 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store v_ArrVal_5883 .cse84 (select v_ArrVal_5885 .cse84))))) (not (= (let ((.cse85 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse85 (select v_ArrVal_5883 .cse85))) v_ArrVal_5883)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse83) (not (= .cse86 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse0) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse91 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse92 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse93 (select (let ((.cse96 (store .cse91 .cse92 v_ArrVal_5885))) (select .cse96 (select (select .cse96 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (= (select (let ((.cse90 (store .cse91 .cse92 v_prenex_25))) (select .cse90 (select (select .cse90 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) .cse93) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 0) (not (= (let ((.cse94 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store (select .cse91 .cse92) .cse94 (select v_ArrVal_5885 .cse94))) v_ArrVal_5885)) (not (= (let ((.cse95 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse95 (select v_ArrVal_5883 .cse95))) v_ArrVal_5883)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse93) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (or (not (= (let ((.cse97 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse97 (select v_ArrVal_5883 .cse97))) v_ArrVal_5883)) (forall ((v_prenex_26 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int))) (let ((.cse100 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse101 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse104 (store .cse100 .cse101 v_prenex_25))) (let ((.cse102 (select .cse104 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse98 (select (select .cse104 (select .cse102 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0))) (or (= .cse98 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse98 (select (let ((.cse99 (store .cse100 .cse101 v_ArrVal_5885))) (select .cse99 (select (select .cse99 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (< v_prenex_26 0) (= (select .cse102 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (let ((.cse103 (+ v_prenex_26 8))) (store (select .cse100 .cse101) .cse103 (select v_prenex_25 .cse103))) v_prenex_25)))))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse107 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse108 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse105 (select (let ((.cse113 (store .cse107 .cse108 v_prenex_25))) (select .cse113 (select (select .cse113 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (= .cse105 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse105 (select (let ((.cse106 (store .cse107 .cse108 v_ArrVal_5885))) (select .cse106 (select (select .cse106 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (< v_prenex_24 0) (not (let ((.cse109 (store .cse107 .cse108 v_prenex_23))) (let ((.cse110 (select (select .cse109 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse109 .cse110) 0) .cse110)))) (not (= v_prenex_23 (let ((.cse111 (+ v_prenex_24 8))) (store (select .cse107 .cse108) .cse111 (select v_prenex_23 .cse111))))) (not (= (let ((.cse112 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse112 (select v_ArrVal_5883 .cse112))) v_ArrVal_5883)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse0) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse117 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= v_prenex_23 (let ((.cse114 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse114 (select v_prenex_23 .cse114))))) (not (let ((.cse115 (store (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883) .cse117 v_prenex_23))) (let ((.cse116 (select (select .cse115 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse115 .cse116) 0) .cse116)))) (not (= (let ((.cse118 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse118 (select v_ArrVal_5883 .cse118))) v_ArrVal_5883)) (not (= .cse117 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse120 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse121 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (let ((.cse119 (store .cse120 .cse121 v_prenex_25))) (select .cse119 (select (select .cse119 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_23 (let ((.cse122 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse122 (select v_prenex_23 .cse122))))) (not (let ((.cse123 (store .cse120 .cse121 v_prenex_23))) (let ((.cse124 (select (select .cse123 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse123 .cse124) 0) .cse124)))) (not (= (let ((.cse125 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse125 (select v_ArrVal_5883 .cse125))) v_ArrVal_5883)) (not (= .cse121 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (or (forall ((v_prenex_28 Int) (v_prenex_27 (Array Int Int))) (let ((.cse129 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse130 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse127 (store .cse129 .cse130 v_prenex_27))) (let ((.cse128 (select .cse127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (not (let ((.cse126 (select .cse128 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse126 (select (select .cse127 .cse126) 0)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select .cse128 0)) (not (= v_prenex_27 (let ((.cse131 (+ v_prenex_28 8))) (store (select .cse129 .cse130) .cse131 (select v_prenex_27 .cse131))))) (< v_prenex_28 0)))))) (not (= (let ((.cse132 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse132 (select v_ArrVal_5883 .cse132))) v_ArrVal_5883)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse135 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse136 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= (let ((.cse133 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse133 (select v_ArrVal_5883 .cse133))) v_ArrVal_5883)) (forall ((v_ArrVal_5885 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (let ((.cse134 (store .cse135 .cse136 v_ArrVal_5885))) (select .cse134 (select (select .cse134 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (forall ((v_prenex_26 Int) (v_prenex_25 (Array Int Int))) (let ((.cse137 (store .cse135 .cse136 v_prenex_25))) (let ((.cse138 (select .cse137 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (= (select (select .cse137 (select .cse138 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_26 0) (= (select .cse138 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (let ((.cse139 (+ v_prenex_26 8))) (store (select .cse135 .cse136) .cse139 (select v_prenex_25 .cse139))) v_prenex_25))))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse144 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse145 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= (let ((.cse140 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse5 .cse140 (select v_ArrVal_5883 .cse140))) v_ArrVal_5883)) (forall ((v_prenex_26 Int) (v_prenex_25 (Array Int Int))) (let ((.cse141 (store .cse144 .cse145 v_prenex_25))) (let ((.cse142 (select .cse141 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (= (select (select .cse141 (select .cse142 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select .cse142 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_25 (let ((.cse143 (+ v_prenex_26 8))) (store v_ArrVal_5883 .cse143 (select v_prenex_25 .cse143))))))))) (forall ((v_ArrVal_5885 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (let ((.cse146 (store .cse144 .cse145 v_ArrVal_5885))) (select .cse146 (select (select .cse146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (not (= .cse145 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from true [2024-11-13 13:10:37,873 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse9 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (and (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse8 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse3 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (let ((.cse1 (store .cse2 .cse3 v_prenex_25))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) (select (let ((.cse4 (store .cse2 .cse3 v_ArrVal_5885))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (< v_prenex_24 0) (not (let ((.cse5 (store .cse2 .cse3 v_prenex_23))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse5 .cse6) 0) .cse6)))) (not (= (let ((.cse7 (+ v_prenex_24 8))) (store (select .cse2 .cse3) .cse7 (select v_prenex_23 .cse7))) v_prenex_23)) (not (= v_ArrVal_5883 (let ((.cse10 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_5883 .cse10))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse19 (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse21 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse14 (store .cse19 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse15 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= v_prenex_23 (let ((.cse12 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse12 (select v_prenex_23 .cse12))))) (= (select (let ((.cse13 (store .cse14 .cse15 v_prenex_25))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) (select (let ((.cse16 (store .cse14 .cse15 v_ArrVal_5885))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (not (let ((.cse17 (store .cse14 .cse15 v_prenex_23))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse17 .cse18) 0) .cse18)))) (not (= v_ArrVal_5883 (let ((.cse20 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse20 (select v_ArrVal_5883 .cse20))))) (not (= .cse15 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse26 (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse27 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_28 Int) (v_prenex_27 (Array Int Int))) (let ((.cse24 (store (store .cse26 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883) .cse27 v_prenex_27))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (not (= v_prenex_27 (let ((.cse22 (+ v_prenex_28 8))) (store v_ArrVal_5883 .cse22 (select v_prenex_27 .cse22))))) (not (let ((.cse23 (select .cse25 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse23 (select (select .cse24 .cse23) 0)))) (= (select .cse25 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (not (= v_ArrVal_5883 (let ((.cse28 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse28 (select v_ArrVal_5883 .cse28))))) (not (= .cse27 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse35 (let ((.cse38 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse38 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse32 (store .cse35 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse33 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse34 (select (let ((.cse37 (store .cse32 .cse33 v_ArrVal_5885))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (not (= v_ArrVal_5885 (let ((.cse30 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store v_ArrVal_5883 .cse30 (select v_ArrVal_5885 .cse30))))) (= (select (let ((.cse31 (store .cse32 .cse33 v_prenex_25))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) .cse34) (not (= v_ArrVal_5883 (let ((.cse36 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse36 (select v_ArrVal_5883 .cse36))))) (= .cse34 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= .cse33 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse43 (let ((.cse46 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse41 (store .cse43 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse42 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= v_ArrVal_5885 (let ((.cse39 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store v_ArrVal_5883 .cse39 (select v_ArrVal_5885 .cse39))))) (= (select (let ((.cse40 (store .cse41 .cse42 v_prenex_25))) (select .cse40 (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_ArrVal_5883 (let ((.cse44 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse43 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse44 (select v_ArrVal_5883 .cse44))))) (= (select (let ((.cse45 (store .cse41 .cse42 v_ArrVal_5885))) (select .cse45 (select (select .cse45 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= .cse42 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse54 (let ((.cse57 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse57 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse57 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse50 (store .cse54 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse51 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse48 (select (let ((.cse56 (store .cse50 .cse51 v_prenex_25))) (select .cse56 (select (select .cse56 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (not (= v_prenex_23 (let ((.cse47 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse47 (select v_prenex_23 .cse47))))) (= .cse48 (select (let ((.cse49 (store .cse50 .cse51 v_ArrVal_5885))) (select .cse49 (select (select .cse49 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (= .cse48 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (let ((.cse52 (store .cse50 .cse51 v_prenex_23))) (let ((.cse53 (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse52 .cse53) 0) .cse53)))) (not (= v_ArrVal_5883 (let ((.cse55 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse54 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse55 (select v_ArrVal_5883 .cse55))))) (not (= .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) .cse0) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_23 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse61 (let ((.cse64 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse64 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse64 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse62 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= v_prenex_23 (let ((.cse58 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse58 (select v_prenex_23 .cse58))))) (not (let ((.cse59 (store (store .cse61 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883) .cse62 v_prenex_23))) (let ((.cse60 (select (select .cse59 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse59 .cse60) 0) .cse60)))) (not (= v_ArrVal_5883 (let ((.cse63 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse61 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse63 (select v_ArrVal_5883 .cse63))))) (not (= .cse62 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse68 (let ((.cse73 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse73 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse73 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse66 (store .cse68 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse67 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_5885 (Array Int Int))) (= (select (let ((.cse65 (store .cse66 .cse67 v_ArrVal_5885))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= v_ArrVal_5883 (let ((.cse69 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse68 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse69 (select v_ArrVal_5883 .cse69))))) (forall ((v_prenex_26 Int) (v_prenex_25 (Array Int Int))) (let ((.cse71 (store .cse66 .cse67 v_prenex_25))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (< v_prenex_26 0) (not (= (let ((.cse70 (+ v_prenex_26 8))) (store (select .cse66 .cse67) .cse70 (select v_prenex_25 .cse70))) v_prenex_25)) (= (select (select .cse71 (select .cse72 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select .cse72 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse80 (let ((.cse82 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse82 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse75 (store .cse80 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse76 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (let ((.cse74 (store .cse75 .cse76 v_prenex_25))) (select .cse74 (select (select .cse74 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_24 0) (not (let ((.cse77 (store .cse75 .cse76 v_prenex_23))) (let ((.cse78 (select (select .cse77 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse77 .cse78) 0) .cse78)))) (not (= (let ((.cse79 (+ v_prenex_24 8))) (store (select .cse75 .cse76) .cse79 (select v_prenex_23 .cse79))) v_prenex_23)) (not (= v_ArrVal_5883 (let ((.cse81 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse80 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse81 (select v_ArrVal_5883 .cse81))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse0) (forall ((v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse89 (let ((.cse91 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse91 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse91 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse84 (store .cse89 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse85 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_5885 (Array Int Int))) (= (select (let ((.cse83 (store .cse84 .cse85 v_ArrVal_5885))) (select .cse83 (select (select .cse83 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_prenex_26 Int) (v_prenex_25 (Array Int Int))) (let ((.cse86 (store .cse84 .cse85 v_prenex_25))) (let ((.cse87 (select .cse86 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (= (select (select .cse86 (select .cse87 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_25 (let ((.cse88 (+ v_prenex_26 8))) (store v_ArrVal_5883 .cse88 (select v_prenex_25 .cse88))))) (= (select .cse87 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (not (= v_ArrVal_5883 (let ((.cse90 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse89 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse90 (select v_ArrVal_5883 .cse90))))) (not (= .cse85 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse94 (let ((.cse101 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse101 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse101 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse96 (store .cse94 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse97 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse92 (select (let ((.cse100 (store .cse96 .cse97 v_prenex_25))) (select .cse100 (select (select .cse100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (.cse93 (select (let ((.cse99 (store .cse96 .cse97 v_ArrVal_5885))) (select .cse99 (select (select .cse99 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 0) (= .cse92 .cse93) (= .cse92 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_ArrVal_5883 (let ((.cse95 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse94 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse95 (select v_ArrVal_5883 .cse95))))) (= .cse93 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_ArrVal_5885 (let ((.cse98 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store (select .cse96 .cse97) .cse98 (select v_ArrVal_5885 .cse98))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) .cse0) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse108 (let ((.cse110 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse110 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse110 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse104 (store .cse108 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse105 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (not (= v_prenex_23 (let ((.cse102 (+ v_prenex_24 8))) (store v_ArrVal_5883 .cse102 (select v_prenex_23 .cse102))))) (= (select (let ((.cse103 (store .cse104 .cse105 v_prenex_25))) (select .cse103 (select (select .cse103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (let ((.cse106 (store .cse104 .cse105 v_prenex_23))) (let ((.cse107 (select (select .cse106 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse106 .cse107) 0) .cse107)))) (not (= v_ArrVal_5883 (let ((.cse109 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse108 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse109 (select v_ArrVal_5883 .cse109))))) (not (= .cse105 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse0) (forall ((v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse118 (let ((.cse120 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or (forall ((v_prenex_26 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int))) (let ((.cse113 (store .cse118 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse114 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse117 (store .cse113 .cse114 v_prenex_25))) (let ((.cse116 (select .cse117 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse111 (select (select .cse117 (select .cse116 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0))) (or (< v_prenex_26 0) (= .cse111 (select (let ((.cse112 (store .cse113 .cse114 v_ArrVal_5885))) (select .cse112 (select (select .cse112 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (not (= (let ((.cse115 (+ v_prenex_26 8))) (store (select .cse113 .cse114) .cse115 (select v_prenex_25 .cse115))) v_prenex_25)) (= .cse111 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select .cse116 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) (not (= v_ArrVal_5883 (let ((.cse119 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse118 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse119 (select v_ArrVal_5883 .cse119)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse124 (let ((.cse130 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse130 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse130 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse128 (store .cse124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse126 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse122 (select (let ((.cse129 (store .cse128 .cse126 v_prenex_25))) (select .cse129 (select (select .cse129 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (.cse123 (select (let ((.cse127 (store .cse128 .cse126 v_ArrVal_5885))) (select .cse127 (select (select .cse127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (not (= v_ArrVal_5885 (let ((.cse121 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store v_ArrVal_5883 .cse121 (select v_ArrVal_5885 .cse121))))) (= .cse122 .cse123) (= .cse122 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_ArrVal_5883 (let ((.cse125 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse125 (select v_ArrVal_5883 .cse125))))) (= .cse123 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= .cse126 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) .cse0) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_prenex_23 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse136 (let ((.cse138 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse138 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse138 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse133 (store .cse136 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse134 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (< v_prenex_24 0) (not (let ((.cse131 (store .cse133 .cse134 v_prenex_23))) (let ((.cse132 (select (select .cse131 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse131 .cse132) 0) .cse132)))) (not (= (let ((.cse135 (+ v_prenex_24 8))) (store (select .cse133 .cse134) .cse135 (select v_prenex_23 .cse135))) v_prenex_23)) (not (= v_ArrVal_5883 (let ((.cse137 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse136 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse137 (select v_ArrVal_5883 .cse137))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse0) (forall ((v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse141 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse139 (let ((.cse148 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse148 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse148 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or (not (= v_ArrVal_5883 (let ((.cse140 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse139 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse140 (select v_ArrVal_5883 .cse140))))) (not (= .cse141 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_prenex_26 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int))) (let ((.cse144 (store .cse139 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883))) (let ((.cse147 (store .cse144 .cse141 v_prenex_25))) (let ((.cse146 (select .cse147 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse142 (select (select .cse147 (select .cse146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0))) (or (= .cse142 (select (let ((.cse143 (store .cse144 .cse141 v_ArrVal_5885))) (select .cse143 (select (select .cse143 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (= .cse142 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_25 (let ((.cse145 (+ v_prenex_26 8))) (store v_ArrVal_5883 .cse145 (select v_prenex_25 .cse145))))) (= (select .cse146 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (forall ((v_ArrVal_5883 (Array Int Int))) (let ((.cse155 (let ((.cse157 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse157 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse157 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or (forall ((v_prenex_28 Int) (v_prenex_27 (Array Int Int))) (let ((.cse152 (store .cse155 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse153 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse150 (store .cse152 .cse153 v_prenex_27))) (let ((.cse151 (select .cse150 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (not (let ((.cse149 (select .cse151 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse149 (select (select .cse150 .cse149) 0)))) (= (select .cse151 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_28 0) (not (= v_prenex_27 (let ((.cse154 (+ v_prenex_28 8))) (store (select .cse152 .cse153) .cse154 (select v_prenex_27 .cse154)))))))))) (not (= v_ArrVal_5883 (let ((.cse156 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse155 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse156 (select v_ArrVal_5883 .cse156)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_prenex_24 Int) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse165 (let ((.cse168 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse168 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse168 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse160 (store .cse165 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse161 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse158 (select (let ((.cse167 (store .cse160 .cse161 v_prenex_25))) (select .cse167 (select (select .cse167 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (= .cse158 (select (let ((.cse159 (store .cse160 .cse161 v_ArrVal_5885))) (select .cse159 (select (select .cse159 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0)) (= .cse158 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_24 0) (not (let ((.cse162 (store .cse160 .cse161 v_prenex_23))) (let ((.cse163 (select (select .cse162 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select .cse162 .cse163) 0) .cse163)))) (not (= (let ((.cse164 (+ v_prenex_24 8))) (store (select .cse160 .cse161) .cse164 (select v_prenex_23 .cse164))) v_prenex_23)) (not (= v_ArrVal_5883 (let ((.cse166 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse165 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse166 (select v_ArrVal_5883 .cse166))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) .cse0) (or .cse0 (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse172 (let ((.cse176 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse176 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse176 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse170 (store .cse172 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse171 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 0) (= (select (let ((.cse169 (store .cse170 .cse171 v_prenex_25))) (select .cse169 (select (select .cse169 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_ArrVal_5883 (let ((.cse173 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse172 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse173 (select v_ArrVal_5883 .cse173))))) (= (select (let ((.cse174 (store .cse170 .cse171 v_ArrVal_5885))) (select .cse174 (select (select .cse174 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_ArrVal_5885 (let ((.cse175 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store (select .cse170 .cse171) .cse175 (select v_ArrVal_5885 .cse175))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or (forall ((v_ArrVal_5883 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_ArrVal_5878 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (let ((.cse181 (let ((.cse185 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5878))) (store .cse185 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse185 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse178 (store .cse181 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5883)) (.cse179 (select v_ArrVal_5883 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse180 (select (let ((.cse184 (store .cse178 .cse179 v_ArrVal_5885))) (select .cse184 (select (select .cse184 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 0) (= (select (let ((.cse177 (store .cse178 .cse179 v_prenex_25))) (select .cse177 (select (select .cse177 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) .cse180) (not (= v_ArrVal_5883 (let ((.cse182 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store (store (select .cse181 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse182 (select v_ArrVal_5883 .cse182))))) (= .cse180 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_ArrVal_5885 (let ((.cse183 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_98| 8))) (store (select .cse178 .cse179) .cse183 (select v_ArrVal_5885 .cse183))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) .cse0))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from true [2024-11-13 13:10:42,270 INFO L349 Elim1Store]: treesize reduction 46, result has 56.6 percent of original size [2024-11-13 13:10:42,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 25884 treesize of output 24607 [2024-11-13 13:10:42,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:10:42,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1210 treesize of output 1236 [2024-11-13 13:10:42,671 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:42,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:42,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:42,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:43,558 INFO L349 Elim1Store]: treesize reduction 98, result has 51.2 percent of original size [2024-11-13 13:10:43,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 943 treesize of output 1128 [2024-11-13 13:10:46,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-13 13:10:46,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-13 13:10:50,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 13:10:51,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 13:10:54,973 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:54,975 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:55,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:10:55,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 3282 treesize of output 3304 [2024-11-13 13:10:57,936 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:57,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:57,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 17 [2024-11-13 13:10:58,031 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:58,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:58,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2024-11-13 13:10:59,161 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:59,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:59,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 17 [2024-11-13 13:10:59,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:10:59,654 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:11:01,743 INFO L349 Elim1Store]: treesize reduction 125, result has 44.7 percent of original size [2024-11-13 13:11:01,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 4266 treesize of output 4384 [2024-11-13 13:12:29,284 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:29,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:29,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:29,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:29,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:29,350 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:29,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:29,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:29,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1125 treesize of output 1141 [2024-11-13 13:12:30,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:30,145 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:30,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:30,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:30,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:30,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:30,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:30,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:30,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:30,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1280 treesize of output 1296 [2024-11-13 13:12:30,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:30,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:30,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:30,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:31,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:31,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:31,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2024-11-13 13:12:31,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:31,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:31,482 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:31,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:31,512 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:31,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:31,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:31,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 464 [2024-11-13 13:12:32,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:32,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:32,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:32,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:32,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:32,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:32,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:32,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 464 [2024-11-13 13:12:33,745 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:33,770 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:33,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:33,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:33,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:33,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:33,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 2042 treesize of output 2014 [2024-11-13 13:12:34,551 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:34,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:34,584 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:34,636 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:34,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:34,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:34,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 2117 treesize of output 2089 [2024-11-13 13:12:35,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:35,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:35,505 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:35,521 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:35,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:35,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 213 [2024-11-13 13:12:36,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:36,369 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,392 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,410 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,412 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,414 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 480 treesize of output 468 [2024-11-13 13:12:36,723 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:36,746 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,765 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:36,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 464 [2024-11-13 13:12:37,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:37,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:37,774 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:37,794 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:37,797 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:37,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 326 [2024-11-13 13:12:38,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:38,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:38,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:38,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:38,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:38,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 322 [2024-11-13 13:12:38,807 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:38,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:38,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:38,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:38,862 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:38,862 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:38,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:38,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 179 [2024-11-13 13:12:39,690 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:39,716 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:39,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:39,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:39,731 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:39,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:39,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:39,760 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:39,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:39,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 162 [2024-11-13 13:12:40,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:40,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:40,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:40,280 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:40,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:40,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2024-11-13 13:12:40,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:40,866 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:40,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:40,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:40,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2024-11-13 13:12:41,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,141 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:41,147 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,156 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,157 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2024-11-13 13:12:41,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,483 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,485 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:41,505 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,509 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,512 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2024-11-13 13:12:41,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:41,664 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,692 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,695 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:41,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:41,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 123 [2024-11-13 13:12:42,371 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:42,374 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:42,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:42,393 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:42,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2024-11-13 13:12:42,477 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:42,478 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:42,498 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:42,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 85 [2024-11-13 13:12:43,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,104 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,106 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:43,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 227 [2024-11-13 13:12:43,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,624 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,648 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,650 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:43,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 187 [2024-11-13 13:12:44,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:44,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:44,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:44,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:44,546 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:44,564 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:44,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:44,576 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:44,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:44,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:44,643 INFO L378 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 3441 treesize of output 3449 [2024-11-13 13:12:45,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:45,364 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:45,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1280 treesize of output 1296 [2024-11-13 13:12:45,857 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,860 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:12:45,866 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:45,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2024-11-13 13:12:46,154 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:46,186 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:46,244 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:46,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:48,590 INFO L349 Elim1Store]: treesize reduction 406, result has 37.2 percent of original size [2024-11-13 13:12:48,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 5356 treesize of output 4626 [2024-11-13 13:13:13,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:13,518 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:13,521 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:13,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:13,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:13,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:13,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:13,820 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:13,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:13,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:13,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:13,959 INFO L224 Elim1Store]: Index analysis took 142 ms [2024-11-13 13:13:13,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:14,469 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:14,472 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:14,658 INFO L224 Elim1Store]: Index analysis took 215 ms [2024-11-13 13:13:14,705 INFO L349 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2024-11-13 13:13:14,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:14,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:14,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:15,200 INFO L224 Elim1Store]: Index analysis took 266 ms [2024-11-13 13:13:15,252 INFO L349 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2024-11-13 13:13:15,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:15,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:15,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:15,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:15,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:15,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:15,769 INFO L224 Elim1Store]: Index analysis took 140 ms [2024-11-13 13:13:15,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:16,249 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:16,251 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:16,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:16,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:16,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:16,411 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:16,413 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:16,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:16,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:16,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:16,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:16,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:16,941 INFO L224 Elim1Store]: Index analysis took 211 ms [2024-11-13 13:13:16,994 INFO L349 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2024-11-13 13:13:16,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:17,761 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:17,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:17,948 INFO L224 Elim1Store]: Index analysis took 213 ms [2024-11-13 13:13:17,997 INFO L349 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2024-11-13 13:13:17,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:18,215 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:18,410 INFO L224 Elim1Store]: Index analysis took 247 ms [2024-11-13 13:13:18,485 INFO L349 Elim1Store]: treesize reduction 200, result has 0.5 percent of original size [2024-11-13 13:13:18,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:19,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:19,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:19,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:19,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:19,543 INFO L224 Elim1Store]: Index analysis took 194 ms [2024-11-13 13:13:19,599 INFO L349 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2024-11-13 13:13:19,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 45 [2024-11-13 13:13:28,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:28,112 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:28,133 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:28,239 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-13 13:13:28,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 8 [2024-11-13 13:13:28,872 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:28,873 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:28,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:28,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:28,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:28,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:28,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:28,937 INFO L378 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 55 treesize of output 13 [2024-11-13 13:13:30,181 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,182 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,200 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:30,288 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2024-11-13 13:13:30,288 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 13 [2024-11-13 13:13:30,456 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,457 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,475 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,547 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 13:13:30,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 8 [2024-11-13 13:13:30,968 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:30,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:30,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 8 [2024-11-13 13:13:31,962 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:31,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:31,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:31,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:31,994 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2024-11-13 13:13:32,393 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:32,396 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:32,398 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:32,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:32,429 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 17 [2024-11-13 13:13:33,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:33,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:33,227 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:33,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:33,373 INFO L349 Elim1Store]: treesize reduction 51, result has 16.4 percent of original size [2024-11-13 13:13:33,373 INFO L378 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 5 case distinctions, treesize of input 55 treesize of output 23 [2024-11-13 13:13:33,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:33,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:33,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:33,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:33,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 8 [2024-11-13 13:13:34,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:34,010 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:34,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:34,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:34,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 8 [2024-11-13 13:13:34,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:34,161 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:34,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:34,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:34,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 8 [2024-11-13 13:13:34,518 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:34,520 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:34,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:34,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 8 [2024-11-13 13:13:35,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:35,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:35,224 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-13 13:13:35,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 8 [2024-11-13 13:13:35,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:35,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:35,327 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:35,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:35,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 8 [2024-11-13 13:13:53,217 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:53,269 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:53,277 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:53,810 INFO L349 Elim1Store]: treesize reduction 151, result has 16.1 percent of original size [2024-11-13 13:13:53,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 3305 treesize of output 3283