./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-2.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_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/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_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/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_c8b0beea-17e7-44f7-a3da-a78328da157e/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 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:12:53,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:12:53,317 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:12:53,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:12:53,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:12:53,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:12:53,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:12:53,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:12:53,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:12:53,372 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:12:53,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:12:53,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:12:53,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:12:53,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:12:53,373 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:12:53,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:12:53,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:12:53,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:12:53,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:12:53,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:12:53,377 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:12:53,377 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:12:53,377 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:12:53,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:12:53,377 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:12:53,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:12:53,378 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:12:53,378 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:12:53,378 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:12:53,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:12:53,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:12:53,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:12:53,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:12:53,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:53,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:12:53,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:12:53,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:12:53,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:12:53,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:12:53,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:12:53,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:12:53,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:12:53,379 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_c8b0beea-17e7-44f7-a3da-a78328da157e/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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2024-11-13 13:12:53,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:12:53,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:12:53,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:12:53,693 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:12:53,694 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:12:53,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i Unable to find full path for "g++" [2024-11-13 13:12:55,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:12:55,966 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:12:55,967 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2024-11-13 13:12:55,982 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/data/dd08bb75c/61f5c8da61024a8494c909f1c827d050/FLAGf190b8e70 [2024-11-13 13:12:56,000 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/data/dd08bb75c/61f5c8da61024a8494c909f1c827d050 [2024-11-13 13:12:56,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:12:56,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:12:56,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:56,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:12:56,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:12:56,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b1365c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56, skipping insertion in model container [2024-11-13 13:12:56,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:12:56,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:56,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:12:56,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:56,477 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:12:56,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56 WrapperNode [2024-11-13 13:12:56,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:56,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:56,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:12:56,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:12:56,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,532 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 187 [2024-11-13 13:12:56,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:56,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:12:56,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:12:56,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:12:56,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,575 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-11-13 13:12:56,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:12:56,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:12:56,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:12:56,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:12:56,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (1/1) ... [2024-11-13 13:12:56,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:12:56,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:12:56,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:12:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-13 13:12:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-13 13:12:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:12:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:12:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:12:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:12:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:12:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:12:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:12:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:12:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:12:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:12:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:12:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:12:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:12:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:12:56,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:12:56,833 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:12:56,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:12:57,428 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-11-13 13:12:57,428 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:12:57,446 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:12:57,446 INFO L316 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-13 13:12:57,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:57 BoogieIcfgContainer [2024-11-13 13:12:57,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:12:57,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:12:57,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:12:57,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:12:57,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:12:56" (1/3) ... [2024-11-13 13:12:57,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374ccd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:57, skipping insertion in model container [2024-11-13 13:12:57,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:56" (2/3) ... [2024-11-13 13:12:57,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374ccd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:57, skipping insertion in model container [2024-11-13 13:12:57,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:57" (3/3) ... [2024-11-13 13:12:57,457 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2024-11-13 13:12:57,474 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:12:57,475 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-sorted-2.i that has 2 procedures, 184 locations, 1 initial locations, 12 loop locations, and 75 error locations. [2024-11-13 13:12:57,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:12:57,559 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;@16af5b98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:12:57,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2024-11-13 13:12:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 101 states have (on average 2.108910891089109) internal successors, (213), 176 states have internal predecessors, (213), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:12:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 13:12:57,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:57,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 13:12:57,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:12:57,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:57,583 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-13 13:12:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:57,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179415780] [2024-11-13 13:12:57,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:57,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:57,844 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 13:12:57,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:57,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179415780] [2024-11-13 13:12:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179415780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:57,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:57,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:12:57,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707174680] [2024-11-13 13:12:57,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:57,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:12:57,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:57,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:12:57,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:57,895 INFO L87 Difference]: Start difference. First operand has 184 states, 101 states have (on average 2.108910891089109) internal successors, (213), 176 states have internal predecessors, (213), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:58,187 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2024-11-13 13:12:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:58,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-13 13:12:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:58,198 INFO L225 Difference]: With dead ends: 173 [2024-11-13 13:12:58,198 INFO L226 Difference]: Without dead ends: 171 [2024-11-13 13:12:58,200 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 13:12:58,204 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 157 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:58,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 124 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:58,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-13 13:12:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-13 13:12:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 93 states have (on average 1.946236559139785) internal successors, (181), 169 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2024-11-13 13:12:58,259 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 3 [2024-11-13 13:12:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:58,259 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2024-11-13 13:12:58,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2024-11-13 13:12:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 13:12:58,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:58,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 13:12:58,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:12:58,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:12:58,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:58,262 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-13 13:12:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:58,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302371122] [2024-11-13 13:12:58,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:58,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,420 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 13:12:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:58,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302371122] [2024-11-13 13:12:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302371122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:58,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:12:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879707607] [2024-11-13 13:12:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:58,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:12:58,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:58,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:12:58,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:58,424 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:58,646 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2024-11-13 13:12:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:58,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-13 13:12:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:58,649 INFO L225 Difference]: With dead ends: 168 [2024-11-13 13:12:58,650 INFO L226 Difference]: Without dead ends: 168 [2024-11-13 13:12:58,651 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 13:12:58,652 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:58,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 120 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-13 13:12:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-13 13:12:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 93 states have (on average 1.913978494623656) internal successors, (178), 166 states have internal predecessors, (178), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2024-11-13 13:12:58,673 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 3 [2024-11-13 13:12:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:58,677 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2024-11-13 13:12:58,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2024-11-13 13:12:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:12:58,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:58,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:58,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:12:58,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:12:58,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash 919163538, now seen corresponding path program 1 times [2024-11-13 13:12:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287897906] [2024-11-13 13:12:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,955 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 13:12:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:58,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287897906] [2024-11-13 13:12:58,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287897906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:58,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:12:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728122942] [2024-11-13 13:12:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:58,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:12:58,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:58,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:12:58,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:12:58,960 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:59,296 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2024-11-13 13:12:59,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:12:59,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 13:12:59,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:59,298 INFO L225 Difference]: With dead ends: 166 [2024-11-13 13:12:59,299 INFO L226 Difference]: Without dead ends: 166 [2024-11-13 13:12:59,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:59,300 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 245 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:59,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 95 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:12:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-13 13:12:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-11-13 13:12:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.7289719626168225) internal successors, (185), 162 states have internal predecessors, (185), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2024-11-13 13:12:59,311 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 9 [2024-11-13 13:12:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:59,311 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2024-11-13 13:12:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2024-11-13 13:12:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:12:59,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:59,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:59,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:12:59,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:12:59,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash 919163539, now seen corresponding path program 1 times [2024-11-13 13:12:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289030190] [2024-11-13 13:12:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:59,762 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 13:12:59,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:59,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289030190] [2024-11-13 13:12:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289030190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:59,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:12:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318777572] [2024-11-13 13:12:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:59,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:12:59,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:59,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:12:59,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:59,765 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:00,251 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2024-11-13 13:13:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:13:00,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 13:13:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:00,254 INFO L225 Difference]: With dead ends: 236 [2024-11-13 13:13:00,254 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 13:13:00,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:13:00,255 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 598 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:00,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 134 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:13:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 13:13:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 217. [2024-11-13 13:13:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 160 states have (on average 1.625) internal successors, (260), 215 states have internal predecessors, (260), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 266 transitions. [2024-11-13 13:13:00,279 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 266 transitions. Word has length 9 [2024-11-13 13:13:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:00,279 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 266 transitions. [2024-11-13 13:13:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 266 transitions. [2024-11-13 13:13:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 13:13:00,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:00,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:00,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:13:00,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:00,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 884859318, now seen corresponding path program 1 times [2024-11-13 13:13:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:00,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577287188] [2024-11-13 13:13:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:00,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:00,347 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 13:13:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:00,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577287188] [2024-11-13 13:13:00,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577287188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:00,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:00,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:13:00,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157452903] [2024-11-13 13:13:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:00,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:13:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:00,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:13:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:00,349 INFO L87 Difference]: Start difference. First operand 217 states and 266 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13:13:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:00,382 INFO L93 Difference]: Finished difference Result 263 states and 315 transitions. [2024-11-13 13:13:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:13:00,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-13 13:13:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:00,386 INFO L225 Difference]: With dead ends: 263 [2024-11-13 13:13:00,386 INFO L226 Difference]: Without dead ends: 263 [2024-11-13 13:13:00,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:00,387 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 56 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:00,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 341 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:13:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-13 13:13:00,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 230. [2024-11-13 13:13:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 173 states have (on average 1.6184971098265897) internal successors, (280), 228 states have internal predecessors, (280), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2024-11-13 13:13:00,405 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 13 [2024-11-13 13:13:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:00,406 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2024-11-13 13:13:00,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13:13:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2024-11-13 13:13:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:13:00,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:00,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:00,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:13:00,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:00,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514731, now seen corresponding path program 1 times [2024-11-13 13:13:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:00,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214861077] [2024-11-13 13:13:00,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:00,609 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 13:13:00,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:00,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214861077] [2024-11-13 13:13:00,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214861077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:00,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:00,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672216609] [2024-11-13 13:13:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:00,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:13:00,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:00,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:13:00,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:00,611 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:00,888 INFO L93 Difference]: Finished difference Result 229 states and 283 transitions. [2024-11-13 13:13:00,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:13:00,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 13:13:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:00,890 INFO L225 Difference]: With dead ends: 229 [2024-11-13 13:13:00,890 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 13:13:00,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:00,891 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 4 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:00,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 434 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 13:13:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-13 13:13:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 173 states have (on average 1.6011560693641618) internal successors, (277), 227 states have internal predecessors, (277), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 283 transitions. [2024-11-13 13:13:00,906 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 283 transitions. Word has length 12 [2024-11-13 13:13:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:00,906 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 283 transitions. [2024-11-13 13:13:00,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 283 transitions. [2024-11-13 13:13:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:13:00,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:00,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:00,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:13:00,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:00,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514730, now seen corresponding path program 1 times [2024-11-13 13:13:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:00,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434163846] [2024-11-13 13:13:00,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:00,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:01,174 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 13:13:01,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:01,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434163846] [2024-11-13 13:13:01,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434163846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:01,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:01,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:01,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909471708] [2024-11-13 13:13:01,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:01,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:13:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:01,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:13:01,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:01,177 INFO L87 Difference]: Start difference. First operand 229 states and 283 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:01,453 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2024-11-13 13:13:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:13:01,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 13:13:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:01,455 INFO L225 Difference]: With dead ends: 228 [2024-11-13 13:13:01,455 INFO L226 Difference]: Without dead ends: 228 [2024-11-13 13:13:01,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:01,456 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:01,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 414 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-13 13:13:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-13 13:13:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 173 states have (on average 1.583815028901734) internal successors, (274), 226 states have internal predecessors, (274), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2024-11-13 13:13:01,467 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 12 [2024-11-13 13:13:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:01,467 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2024-11-13 13:13:01,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2024-11-13 13:13:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:13:01,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:01,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:01,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:13:01,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:01,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547560, now seen corresponding path program 1 times [2024-11-13 13:13:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:01,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077056371] [2024-11-13 13:13:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:01,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:02,149 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 13:13:02,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:02,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077056371] [2024-11-13 13:13:02,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077056371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:02,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:02,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:13:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144972114] [2024-11-13 13:13:02,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:02,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:13:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:02,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:13:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:13:02,150 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:02,973 INFO L93 Difference]: Finished difference Result 269 states and 313 transitions. [2024-11-13 13:13:02,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:13:02,974 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:13:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:02,975 INFO L225 Difference]: With dead ends: 269 [2024-11-13 13:13:02,976 INFO L226 Difference]: Without dead ends: 269 [2024-11-13 13:13:02,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:13:02,977 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 564 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:02,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 364 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:13:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-13 13:13:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2024-11-13 13:13:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 197 states have (on average 1.532994923857868) internal successors, (302), 250 states have internal predecessors, (302), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 308 transitions. [2024-11-13 13:13:02,984 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 308 transitions. Word has length 16 [2024-11-13 13:13:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:02,985 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 308 transitions. [2024-11-13 13:13:02,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2024-11-13 13:13:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:13:02,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:02,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:02,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:13:02,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:02,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547561, now seen corresponding path program 1 times [2024-11-13 13:13:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:02,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700736468] [2024-11-13 13:13:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:03,288 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 13:13:03,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700736468] [2024-11-13 13:13:03,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700736468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:03,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:03,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:13:03,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941179880] [2024-11-13 13:13:03,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:03,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:13:03,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:03,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:13:03,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:13:03,291 INFO L87 Difference]: Start difference. First operand 252 states and 308 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:03,816 INFO L93 Difference]: Finished difference Result 251 states and 305 transitions. [2024-11-13 13:13:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:13:03,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:13:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:03,818 INFO L225 Difference]: With dead ends: 251 [2024-11-13 13:13:03,818 INFO L226 Difference]: Without dead ends: 251 [2024-11-13 13:13:03,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:13:03,819 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 237 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:03,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 283 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:13:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-13 13:13:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-13 13:13:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 197 states have (on average 1.517766497461929) internal successors, (299), 249 states have internal predecessors, (299), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 305 transitions. [2024-11-13 13:13:03,835 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 305 transitions. Word has length 16 [2024-11-13 13:13:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:03,836 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 305 transitions. [2024-11-13 13:13:03,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 305 transitions. [2024-11-13 13:13:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:13:03,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:03,837 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 13:13:03,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:13:03,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash -327063291, now seen corresponding path program 1 times [2024-11-13 13:13:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:03,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996200266] [2024-11-13 13:13:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:13:03,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:03,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996200266] [2024-11-13 13:13:03,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996200266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:03,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:03,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:03,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313422907] [2024-11-13 13:13:03,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:03,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:13:03,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:03,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:13:03,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:13:03,949 INFO L87 Difference]: Start difference. First operand 251 states and 305 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 13:13:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:04,136 INFO L93 Difference]: Finished difference Result 266 states and 305 transitions. [2024-11-13 13:13:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:13:04,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2024-11-13 13:13:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:04,138 INFO L225 Difference]: With dead ends: 266 [2024-11-13 13:13:04,138 INFO L226 Difference]: Without dead ends: 266 [2024-11-13 13:13:04,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:04,139 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 271 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:04,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 219 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-13 13:13:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 250. [2024-11-13 13:13:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 197 states have (on average 1.50253807106599) internal successors, (296), 248 states have internal predecessors, (296), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2024-11-13 13:13:04,147 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 27 [2024-11-13 13:13:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:04,147 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2024-11-13 13:13:04,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 13:13:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2024-11-13 13:13:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 13:13:04,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:04,148 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] [2024-11-13 13:13:04,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:13:04,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:04,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1264065193, now seen corresponding path program 1 times [2024-11-13 13:13:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:04,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126836527] [2024-11-13 13:13:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:04,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:05,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126836527] [2024-11-13 13:13:05,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126836527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323059879] [2024-11-13 13:13:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:05,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:05,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:05,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:05,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:13:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:05,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 13:13:05,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:05,245 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:13:05,268 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:05,269 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:13:05,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:13:05,326 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:13:05,466 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:05,466 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 50 treesize of output 45 [2024-11-13 13:13:05,474 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:13:05,521 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 25 treesize of output 13 [2024-11-13 13:13:05,529 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:13:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:05,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:13:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323059879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:13:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2024-11-13 13:13:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766596542] [2024-11-13 13:13:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:05,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:13:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:13:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:13:05,597 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:06,296 INFO L93 Difference]: Finished difference Result 249 states and 297 transitions. [2024-11-13 13:13:06,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:13:06,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-13 13:13:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:06,298 INFO L225 Difference]: With dead ends: 249 [2024-11-13 13:13:06,298 INFO L226 Difference]: Without dead ends: 249 [2024-11-13 13:13:06,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:13:06,299 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 84 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:06,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 456 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:13:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-13 13:13:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2024-11-13 13:13:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 165 states have (on average 1.5212121212121212) internal successors, (251), 210 states have internal predecessors, (251), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 256 transitions. [2024-11-13 13:13:06,307 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 256 transitions. Word has length 30 [2024-11-13 13:13:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:06,307 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 256 transitions. [2024-11-13 13:13:06,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 256 transitions. [2024-11-13 13:13:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 13:13:06,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:06,308 INFO L215 NwaCegarLoop]: trace histogram [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:13:06,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:13:06,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:06,513 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:06,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:06,513 INFO L85 PathProgramCache]: Analyzing trace with hash 618214329, now seen corresponding path program 1 times [2024-11-13 13:13:06,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:06,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756360326] [2024-11-13 13:13:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756360326] [2024-11-13 13:13:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756360326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206683506] [2024-11-13 13:13:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:07,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:07,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:07,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:07,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:13:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:07,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 13:13:07,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:07,273 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:13:07,407 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:13:07,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:13:07,479 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:13:07,639 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:07,639 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 34 treesize of output 33 [2024-11-13 13:13:07,809 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:13:07,809 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:13:07,895 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:07,895 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 34 treesize of output 33 [2024-11-13 13:13:08,117 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 25 treesize of output 13 [2024-11-13 13:13:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:08,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:08,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_459))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_461)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) 1))) is different from false [2024-11-13 13:13:08,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:08,898 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 38 treesize of output 31 [2024-11-13 13:13:08,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:08,917 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 144 treesize of output 131 [2024-11-13 13:13:08,939 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 80 treesize of output 76 [2024-11-13 13:13:08,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:08,957 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 76 treesize of output 74 [2024-11-13 13:13:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:14,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206683506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:14,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2024-11-13 13:13:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168270340] [2024-11-13 13:13:14,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:14,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 13:13:14,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:14,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 13:13:14,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=891, Unknown=16, NotChecked=62, Total=1122 [2024-11-13 13:13:14,500 INFO L87 Difference]: Start difference. First operand 212 states and 256 transitions. Second operand has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:17,490 INFO L93 Difference]: Finished difference Result 320 states and 364 transitions. [2024-11-13 13:13:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:13:17,491 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 13:13:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:17,493 INFO L225 Difference]: With dead ends: 320 [2024-11-13 13:13:17,493 INFO L226 Difference]: Without dead ends: 320 [2024-11-13 13:13:17,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=263, Invalid=1285, Unknown=16, NotChecked=76, Total=1640 [2024-11-13 13:13:17,496 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 506 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:17,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1343 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1756 Invalid, 0 Unknown, 325 Unchecked, 2.5s Time] [2024-11-13 13:13:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-13 13:13:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 237. [2024-11-13 13:13:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 235 states have internal predecessors, (281), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 286 transitions. [2024-11-13 13:13:17,516 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 286 transitions. Word has length 31 [2024-11-13 13:13:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:17,516 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 286 transitions. [2024-11-13 13:13:17,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 286 transitions. [2024-11-13 13:13:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 13:13:17,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:17,517 INFO L215 NwaCegarLoop]: trace histogram [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:13:17,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:13:17,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:17,722 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:17,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash 618214330, now seen corresponding path program 1 times [2024-11-13 13:13:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387529631] [2024-11-13 13:13:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:18,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:18,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387529631] [2024-11-13 13:13:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387529631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:18,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876069904] [2024-11-13 13:13:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:18,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:18,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:18,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:18,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:13:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:18,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 13:13:18,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:18,773 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:13:18,875 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:13:18,899 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:18,901 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:13:18,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:13:18,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 15 treesize of output 1 [2024-11-13 13:13:19,154 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:19,155 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 50 treesize of output 45 [2024-11-13 13:13:19,175 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:13:19,328 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:13:19,329 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:13:19,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:19,346 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:13:19,415 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:19,415 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 50 treesize of output 45 [2024-11-13 13:13:19,420 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:13:19,734 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 25 treesize of output 13 [2024-11-13 13:13:19,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:13:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:19,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:20,821 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_562 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_562) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))))) (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_562) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_563) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|))))) is different from false [2024-11-13 13:13:20,891 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_559) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_562) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_558))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ 11 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_559) .cse0 v_ArrVal_562) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_563) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|)))))))) is different from false [2024-11-13 13:13:21,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:21,162 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 73 treesize of output 74 [2024-11-13 13:13:21,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:21,177 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 65 treesize of output 50 [2024-11-13 13:13:21,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:21,205 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 334 treesize of output 301 [2024-11-13 13:13:21,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:21,273 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 474 treesize of output 457 [2024-11-13 13:13:21,311 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 180 treesize of output 172 [2024-11-13 13:13:21,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 172 treesize of output 164 [2024-11-13 13:13:21,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:21,369 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 164 treesize of output 154 [2024-11-13 13:13:21,392 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 74 treesize of output 70 [2024-11-13 13:13:21,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:21,682 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 38 treesize of output 39 [2024-11-13 13:13:21,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:21,695 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 30 treesize of output 31 [2024-11-13 13:13:21,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:21,704 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 28 treesize of output 20 [2024-11-13 13:13:21,710 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:21,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:21,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:21,717 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 13:13:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:22,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876069904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:22,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:22,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-11-13 13:13:22,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554822736] [2024-11-13 13:13:22,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:22,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 13:13:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 13:13:22,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=991, Unknown=16, NotChecked=130, Total=1260 [2024-11-13 13:13:22,133 INFO L87 Difference]: Start difference. First operand 237 states and 286 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:24,896 INFO L93 Difference]: Finished difference Result 311 states and 355 transitions. [2024-11-13 13:13:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:13:24,897 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 13:13:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:24,898 INFO L225 Difference]: With dead ends: 311 [2024-11-13 13:13:24,898 INFO L226 Difference]: Without dead ends: 311 [2024-11-13 13:13:24,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=284, Invalid=1600, Unknown=16, NotChecked=170, Total=2070 [2024-11-13 13:13:24,899 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 702 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 621 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:24,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1195 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1782 Invalid, 0 Unknown, 621 Unchecked, 2.0s Time] [2024-11-13 13:13:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-13 13:13:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 237. [2024-11-13 13:13:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 235 states have internal predecessors, (280), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2024-11-13 13:13:24,908 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 31 [2024-11-13 13:13:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:24,909 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2024-11-13 13:13:24,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2024-11-13 13:13:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:13:24,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:24,913 INFO L215 NwaCegarLoop]: trace histogram [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:13:24,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:13:25,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 13:13:25,114 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:25,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1407226440, now seen corresponding path program 1 times [2024-11-13 13:13:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996958418] [2024-11-13 13:13:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:13:25,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:25,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996958418] [2024-11-13 13:13:25,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996958418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:25,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:25,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:13:25,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403206092] [2024-11-13 13:13:25,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:25,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:13:25,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:25,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:13:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:25,175 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:25,189 INFO L93 Difference]: Finished difference Result 239 states and 287 transitions. [2024-11-13 13:13:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:13:25,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 13:13:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:25,191 INFO L225 Difference]: With dead ends: 239 [2024-11-13 13:13:25,191 INFO L226 Difference]: Without dead ends: 239 [2024-11-13 13:13:25,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:25,192 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:25,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:13:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-13 13:13:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-13 13:13:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 192 states have (on average 1.46875) internal successors, (282), 237 states have internal predecessors, (282), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2024-11-13 13:13:25,201 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 33 [2024-11-13 13:13:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2024-11-13 13:13:25,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2024-11-13 13:13:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:13:25,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:25,203 INFO L215 NwaCegarLoop]: trace histogram [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:13:25,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:13:25,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1107573533, now seen corresponding path program 1 times [2024-11-13 13:13:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135866543] [2024-11-13 13:13:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:26,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135866543] [2024-11-13 13:13:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135866543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:26,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108483626] [2024-11-13 13:13:26,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:26,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:26,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:26,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:26,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:13:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:26,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 13:13:26,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:26,238 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:13:26,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:26,361 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:13:26,412 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:13:26,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:13:26,573 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:26,573 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 41 treesize of output 38 [2024-11-13 13:13:26,581 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:13:26,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 13:13:26,701 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:13:26,740 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:13:27,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 13:13:27,035 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 26 treesize of output 14 [2024-11-13 13:13:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:27,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:27,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:27,182 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 31 treesize of output 35 [2024-11-13 13:13:27,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_708 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|) 1)))) is different from false [2024-11-13 13:13:27,669 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_706) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_705) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_708) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|) 1)))) is different from false [2024-11-13 13:13:27,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< 0 (+ (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_706) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_705) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_708)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|) 1)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|))) is different from false [2024-11-13 13:13:27,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:27,717 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 38 treesize of output 39 [2024-11-13 13:13:27,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:27,727 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 30 treesize of output 31 [2024-11-13 13:13:27,735 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 54 treesize of output 46 [2024-11-13 13:13:27,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:27,751 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 166 treesize of output 161 [2024-11-13 13:13:27,763 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 56 treesize of output 54 [2024-11-13 13:13:27,772 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 54 treesize of output 50 [2024-11-13 13:13:27,778 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 74 treesize of output 68 [2024-11-13 13:13:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108483626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:28,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 42 [2024-11-13 13:13:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67888894] [2024-11-13 13:13:28,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:28,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 13:13:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:28,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 13:13:28,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1409, Unknown=6, NotChecked=234, Total=1806 [2024-11-13 13:13:28,164 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand has 43 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 43 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:31,852 INFO L93 Difference]: Finished difference Result 440 states and 512 transitions. [2024-11-13 13:13:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-13 13:13:31,852 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 43 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:13:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:31,854 INFO L225 Difference]: With dead ends: 440 [2024-11-13 13:13:31,855 INFO L226 Difference]: Without dead ends: 440 [2024-11-13 13:13:31,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1085, Invalid=6403, Unknown=6, NotChecked=516, Total=8010 [2024-11-13 13:13:31,860 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1258 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 3682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1354 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:31,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1742 Invalid, 3682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 2185 Invalid, 0 Unknown, 1354 Unchecked, 1.8s Time] [2024-11-13 13:13:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-13 13:13:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 264. [2024-11-13 13:13:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 224 states have (on average 1.3883928571428572) internal successors, (311), 262 states have internal predecessors, (311), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 316 transitions. [2024-11-13 13:13:31,871 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 316 transitions. Word has length 36 [2024-11-13 13:13:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:31,872 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 316 transitions. [2024-11-13 13:13:31,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 43 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 316 transitions. [2024-11-13 13:13:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:13:31,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:31,876 INFO L215 NwaCegarLoop]: trace histogram [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:13:31,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 13:13:32,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 13:13:32,077 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:32,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:32,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1107573532, now seen corresponding path program 1 times [2024-11-13 13:13:32,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:32,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919595374] [2024-11-13 13:13:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:13:32,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:32,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919595374] [2024-11-13 13:13:32,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919595374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:32,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:32,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:13:32,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721245504] [2024-11-13 13:13:32,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:32,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:13:32,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:32,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:13:32,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:32,182 INFO L87 Difference]: Start difference. First operand 264 states and 316 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:32,563 INFO L93 Difference]: Finished difference Result 282 states and 340 transitions. [2024-11-13 13:13:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:13:32,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:13:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:32,565 INFO L225 Difference]: With dead ends: 282 [2024-11-13 13:13:32,566 INFO L226 Difference]: Without dead ends: 282 [2024-11-13 13:13:32,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:13:32,567 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 83 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:32,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 359 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:13:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-13 13:13:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 263. [2024-11-13 13:13:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 224 states have (on average 1.3794642857142858) internal successors, (309), 261 states have internal predecessors, (309), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 314 transitions. [2024-11-13 13:13:32,575 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 314 transitions. Word has length 36 [2024-11-13 13:13:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:32,575 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 314 transitions. [2024-11-13 13:13:32,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 314 transitions. [2024-11-13 13:13:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:13:32,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:32,577 INFO L215 NwaCegarLoop]: trace histogram [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:13:32,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:13:32,577 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:32,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2000755810, now seen corresponding path program 1 times [2024-11-13 13:13:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:32,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607657380] [2024-11-13 13:13:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:13:32,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:32,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607657380] [2024-11-13 13:13:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607657380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:32,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:32,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:13:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604151453] [2024-11-13 13:13:32,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:32,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:13:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:32,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:13:32,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:13:32,803 INFO L87 Difference]: Start difference. First operand 263 states and 314 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:33,054 INFO L93 Difference]: Finished difference Result 279 states and 332 transitions. [2024-11-13 13:13:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:13:33,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:13:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:33,056 INFO L225 Difference]: With dead ends: 279 [2024-11-13 13:13:33,056 INFO L226 Difference]: Without dead ends: 279 [2024-11-13 13:13:33,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:13:33,057 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 31 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:33,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 552 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-13 13:13:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2024-11-13 13:13:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 269 states have internal predecessors, (317), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 322 transitions. [2024-11-13 13:13:33,068 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 322 transitions. Word has length 36 [2024-11-13 13:13:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:33,068 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 322 transitions. [2024-11-13 13:13:33,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 322 transitions. [2024-11-13 13:13:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:13:33,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:33,069 INFO L215 NwaCegarLoop]: trace histogram [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:13:33,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:13:33,069 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:33,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2000696228, now seen corresponding path program 1 times [2024-11-13 13:13:33,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:33,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031897357] [2024-11-13 13:13:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:13:33,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:33,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031897357] [2024-11-13 13:13:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031897357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:13:33,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823352051] [2024-11-13 13:13:33,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:33,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:13:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:13:33,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:33,153 INFO L87 Difference]: Start difference. First operand 271 states and 322 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:33,255 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2024-11-13 13:13:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:13:33,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:13:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:33,259 INFO L225 Difference]: With dead ends: 267 [2024-11-13 13:13:33,259 INFO L226 Difference]: Without dead ends: 267 [2024-11-13 13:13:33,260 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 13:13:33,260 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:33,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 212 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:13:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-13 13:13:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-13 13:13:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 232 states have (on average 1.3362068965517242) internal successors, (310), 265 states have internal predecessors, (310), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2024-11-13 13:13:33,269 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 36 [2024-11-13 13:13:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:33,269 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2024-11-13 13:13:33,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,269 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2024-11-13 13:13:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:13:33,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:33,270 INFO L215 NwaCegarLoop]: trace histogram [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:13:33,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:13:33,270 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:33,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2000696227, now seen corresponding path program 1 times [2024-11-13 13:13:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:33,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843550133] [2024-11-13 13:13:33,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:13:33,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:33,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843550133] [2024-11-13 13:13:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843550133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:33,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:13:33,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309401087] [2024-11-13 13:13:33,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:33,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:13:33,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:33,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:13:33,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:33,384 INFO L87 Difference]: Start difference. First operand 267 states and 315 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:33,472 INFO L93 Difference]: Finished difference Result 263 states and 308 transitions. [2024-11-13 13:13:33,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:13:33,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:13:33,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:33,474 INFO L225 Difference]: With dead ends: 263 [2024-11-13 13:13:33,474 INFO L226 Difference]: Without dead ends: 263 [2024-11-13 13:13:33,475 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 13:13:33,475 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 15 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:33,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 208 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:13:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-13 13:13:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-13 13:13:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 232 states have (on average 1.3060344827586208) internal successors, (303), 261 states have internal predecessors, (303), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 308 transitions. [2024-11-13 13:13:33,482 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 308 transitions. Word has length 36 [2024-11-13 13:13:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:33,483 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 308 transitions. [2024-11-13 13:13:33,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 308 transitions. [2024-11-13 13:13:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:13:33,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:33,484 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-13 13:13:33,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:13:33,484 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:33,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash -18398360, now seen corresponding path program 1 times [2024-11-13 13:13:33,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:33,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124789628] [2024-11-13 13:13:33,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:33,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:13:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124789628] [2024-11-13 13:13:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124789628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:33,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:33,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:13:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139636476] [2024-11-13 13:13:33,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:33,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:13:33,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:33,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:13:33,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:33,603 INFO L87 Difference]: Start difference. First operand 263 states and 308 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:33,911 INFO L93 Difference]: Finished difference Result 279 states and 328 transitions. [2024-11-13 13:13:33,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:13:33,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-13 13:13:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:33,913 INFO L225 Difference]: With dead ends: 279 [2024-11-13 13:13:33,913 INFO L226 Difference]: Without dead ends: 279 [2024-11-13 13:13:33,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:13:33,914 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 72 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:33,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 333 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:13:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-13 13:13:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 269. [2024-11-13 13:13:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 267 states have internal predecessors, (312), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 317 transitions. [2024-11-13 13:13:33,921 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 317 transitions. Word has length 40 [2024-11-13 13:13:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:33,921 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 317 transitions. [2024-11-13 13:13:33,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 317 transitions. [2024-11-13 13:13:33,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:13:33,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:33,922 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-13 13:13:33,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:13:33,922 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash -18398359, now seen corresponding path program 1 times [2024-11-13 13:13:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:33,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009291585] [2024-11-13 13:13:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:34,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:34,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009291585] [2024-11-13 13:13:34,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009291585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:34,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466814009] [2024-11-13 13:13:34,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:34,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:34,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:34,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:34,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:13:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:34,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 13:13:34,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:34,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 13:13:34,775 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 28 treesize of output 16 [2024-11-13 13:13:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:13:34,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:13:34,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466814009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:34,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:13:34,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 13:13:34,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469831739] [2024-11-13 13:13:34,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:34,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:13:34,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:34,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:13:34,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:13:34,833 INFO L87 Difference]: Start difference. First operand 269 states and 317 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:35,157 INFO L93 Difference]: Finished difference Result 277 states and 323 transitions. [2024-11-13 13:13:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:13:35,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-13 13:13:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:35,158 INFO L225 Difference]: With dead ends: 277 [2024-11-13 13:13:35,159 INFO L226 Difference]: Without dead ends: 277 [2024-11-13 13:13:35,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:13:35,159 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 35 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:35,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 410 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:13:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-13 13:13:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2024-11-13 13:13:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 238 states have (on average 1.2899159663865547) internal successors, (307), 265 states have internal predecessors, (307), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 312 transitions. [2024-11-13 13:13:35,169 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 312 transitions. Word has length 40 [2024-11-13 13:13:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:35,170 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 312 transitions. [2024-11-13 13:13:35,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 312 transitions. [2024-11-13 13:13:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:13:35,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:35,171 INFO L215 NwaCegarLoop]: trace histogram [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:13:35,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:13:35,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:35,375 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:35,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -518467166, now seen corresponding path program 1 times [2024-11-13 13:13:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:35,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195782653] [2024-11-13 13:13:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:36,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:36,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195782653] [2024-11-13 13:13:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195782653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:36,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413385286] [2024-11-13 13:13:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:36,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:36,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:36,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:36,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:13:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:36,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-13 13:13:36,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:36,349 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:13:36,438 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:36,439 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:13:36,511 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:13:36,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:13:36,629 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:36,629 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 41 treesize of output 38 [2024-11-13 13:13:36,636 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:13:36,775 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:13:36,776 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 23 treesize of output 20 [2024-11-13 13:13:36,786 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 7 [2024-11-13 13:13:36,807 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:13:36,807 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:13:36,908 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:36,909 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 66 treesize of output 59 [2024-11-13 13:13:36,913 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 25 treesize of output 17 [2024-11-13 13:13:36,917 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 41 treesize of output 26 [2024-11-13 13:13:37,180 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 33 treesize of output 21 [2024-11-13 13:13:37,237 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 13 treesize of output 3 [2024-11-13 13:13:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:37,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:37,879 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 46 treesize of output 26 [2024-11-13 13:13:39,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:39,013 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 36 treesize of output 37 [2024-11-13 13:13:39,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:39,021 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 80 treesize of output 56 [2024-11-13 13:13:39,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:39,038 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 211 treesize of output 174 [2024-11-13 13:13:39,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:39,076 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 186 treesize of output 181 [2024-11-13 13:13:39,093 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 64 treesize of output 62 [2024-11-13 13:13:39,104 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 90 treesize of output 84 [2024-11-13 13:13:39,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:39,121 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 127 treesize of output 113 [2024-11-13 13:13:39,131 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 74 treesize of output 68 [2024-11-13 13:13:39,416 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 13:13:39,416 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 88 treesize of output 1 [2024-11-13 13:13:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413385286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:39,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 19] total 47 [2024-11-13 13:13:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57908743] [2024-11-13 13:13:39,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:39,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-13 13:13:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:39,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-13 13:13:39,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2014, Unknown=11, NotChecked=0, Total=2162 [2024-11-13 13:13:39,788 INFO L87 Difference]: Start difference. First operand 267 states and 312 transitions. Second operand has 47 states, 47 states have (on average 2.382978723404255) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:42,900 INFO L93 Difference]: Finished difference Result 319 states and 368 transitions. [2024-11-13 13:13:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 13:13:42,901 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.382978723404255) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-13 13:13:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:42,902 INFO L225 Difference]: With dead ends: 319 [2024-11-13 13:13:42,902 INFO L226 Difference]: Without dead ends: 319 [2024-11-13 13:13:42,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=417, Invalid=3994, Unknown=11, NotChecked=0, Total=4422 [2024-11-13 13:13:42,905 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 616 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 2581 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:42,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2252 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 13:13:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-13 13:13:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 269. [2024-11-13 13:13:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 240 states have (on average 1.2875) internal successors, (309), 267 states have internal predecessors, (309), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2024-11-13 13:13:42,913 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 40 [2024-11-13 13:13:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:42,913 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2024-11-13 13:13:42,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.382978723404255) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2024-11-13 13:13:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 13:13:42,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:42,915 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-13 13:13:42,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:13:43,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-13 13:13:43,119 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:43,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash 839203724, now seen corresponding path program 1 times [2024-11-13 13:13:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:43,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413078470] [2024-11-13 13:13:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:43,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413078470] [2024-11-13 13:13:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413078470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:43,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482934079] [2024-11-13 13:13:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:43,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:43,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:43,578 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:43,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:13:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:43,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:13:43,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:43,885 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:43,885 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:13:43,913 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:13:43,917 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:13:43,927 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:13:43,932 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:13:43,939 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:13:43,943 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:13:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:13:44,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:13:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482934079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:44,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:13:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2024-11-13 13:13:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983200096] [2024-11-13 13:13:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:13:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:13:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:13:44,004 INFO L87 Difference]: Start difference. First operand 269 states and 314 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:44,415 INFO L93 Difference]: Finished difference Result 283 states and 329 transitions. [2024-11-13 13:13:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:13:44,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-13 13:13:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:44,417 INFO L225 Difference]: With dead ends: 283 [2024-11-13 13:13:44,417 INFO L226 Difference]: Without dead ends: 283 [2024-11-13 13:13:44,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-11-13 13:13:44,418 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 12 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:44,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 541 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:13:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-13 13:13:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 282. [2024-11-13 13:13:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 253 states have (on average 1.2766798418972332) internal successors, (323), 280 states have internal predecessors, (323), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 328 transitions. [2024-11-13 13:13:44,424 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 328 transitions. Word has length 42 [2024-11-13 13:13:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:44,425 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 328 transitions. [2024-11-13 13:13:44,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 328 transitions. [2024-11-13 13:13:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 13:13:44,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:44,425 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-13 13:13:44,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:13:44,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 13:13:44,626 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:44,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash -377250823, now seen corresponding path program 1 times [2024-11-13 13:13:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:44,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318464184] [2024-11-13 13:13:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:44,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:45,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318464184] [2024-11-13 13:13:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318464184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021768891] [2024-11-13 13:13:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:45,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:45,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:45,627 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:45,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:13:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:45,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 13:13:45,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:45,845 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:13:45,902 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:45,903 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:13:45,950 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:13:45,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:13:46,065 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:46,065 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 41 treesize of output 38 [2024-11-13 13:13:46,071 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 16 treesize of output 1 [2024-11-13 13:13:46,173 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:13:46,173 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:13:46,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:46,182 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:13:46,224 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:46,224 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 66 treesize of output 59 [2024-11-13 13:13:46,229 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 25 treesize of output 17 [2024-11-13 13:13:46,233 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:13:46,465 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 33 treesize of output 21 [2024-11-13 13:13:46,469 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:13:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:46,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:46,719 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 69 treesize of output 49 [2024-11-13 13:13:47,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:47,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2024-11-13 13:13:47,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:47,435 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 35 treesize of output 36 [2024-11-13 13:13:47,439 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 64 treesize of output 56 [2024-11-13 13:13:47,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:47,452 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 374 treesize of output 321 [2024-11-13 13:13:47,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:47,468 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 64 treesize of output 63 [2024-11-13 13:13:47,475 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 54 treesize of output 50 [2024-11-13 13:13:47,482 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 74 treesize of output 68 [2024-11-13 13:13:47,572 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 13:13:47,572 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 51 treesize of output 1 [2024-11-13 13:13:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021768891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:47,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:47,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 39 [2024-11-13 13:13:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377210987] [2024-11-13 13:13:47,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:47,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-13 13:13:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:47,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-13 13:13:47,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1331, Unknown=16, NotChecked=0, Total=1482 [2024-11-13 13:13:47,801 INFO L87 Difference]: Start difference. First operand 282 states and 328 transitions. Second operand has 39 states, 39 states have (on average 2.948717948717949) internal successors, (115), 39 states have internal predecessors, (115), 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 13:13:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:49,881 INFO L93 Difference]: Finished difference Result 347 states and 400 transitions. [2024-11-13 13:13:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:13:49,881 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.948717948717949) internal successors, (115), 39 states have internal predecessors, (115), 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 44 [2024-11-13 13:13:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:49,883 INFO L225 Difference]: With dead ends: 347 [2024-11-13 13:13:49,883 INFO L226 Difference]: Without dead ends: 347 [2024-11-13 13:13:49,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=340, Invalid=2614, Unknown=16, NotChecked=0, Total=2970 [2024-11-13 13:13:49,884 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 727 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:49,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1287 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 13:13:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-13 13:13:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 290. [2024-11-13 13:13:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 261 states have (on average 1.2758620689655173) internal successors, (333), 288 states have internal predecessors, (333), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 338 transitions. [2024-11-13 13:13:49,892 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 338 transitions. Word has length 44 [2024-11-13 13:13:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:49,893 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 338 transitions. [2024-11-13 13:13:49,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.948717948717949) internal successors, (115), 39 states have internal predecessors, (115), 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 13:13:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 338 transitions. [2024-11-13 13:13:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 13:13:49,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:49,894 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-13 13:13:49,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:13:50,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 13:13:50,098 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:50,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:50,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1650396340, now seen corresponding path program 1 times [2024-11-13 13:13:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:50,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111131835] [2024-11-13 13:13:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:50,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111131835] [2024-11-13 13:13:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111131835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274426780] [2024-11-13 13:13:50,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:50,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:50,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:50,678 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:50,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:13:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:50,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 13:13:50,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:50,869 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:13:50,953 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:50,954 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:13:50,991 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:13:50,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:13:51,108 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:51,108 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 41 treesize of output 38 [2024-11-13 13:13:51,114 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:13:51,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 13:13:51,192 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:13:51,222 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:13:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:51,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:51,476 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:13:51,957 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (or (< 0 (+ (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1474) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1475) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1477)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_107|) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_107| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_107|))) is different from false [2024-11-13 13:13:51,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:51,976 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 38 treesize of output 39 [2024-11-13 13:13:51,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:51,982 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 30 treesize of output 31 [2024-11-13 13:13:51,986 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 54 treesize of output 46 [2024-11-13 13:13:51,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:51,998 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 166 treesize of output 161 [2024-11-13 13:13:52,013 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 56 treesize of output 54 [2024-11-13 13:13:52,020 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 78 treesize of output 72 [2024-11-13 13:13:52,027 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 50 treesize of output 46 [2024-11-13 13:13:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274426780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:52,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 40 [2024-11-13 13:13:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532227601] [2024-11-13 13:13:52,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:52,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 13:13:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 13:13:52,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1383, Unknown=13, NotChecked=76, Total=1640 [2024-11-13 13:13:52,381 INFO L87 Difference]: Start difference. First operand 290 states and 338 transitions. Second operand has 41 states, 40 states have (on average 2.975) internal successors, (119), 41 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:55,333 INFO L93 Difference]: Finished difference Result 441 states and 505 transitions. [2024-11-13 13:13:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-13 13:13:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 41 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-13 13:13:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:55,335 INFO L225 Difference]: With dead ends: 441 [2024-11-13 13:13:55,335 INFO L226 Difference]: Without dead ends: 441 [2024-11-13 13:13:55,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2269 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1113, Invalid=6355, Unknown=18, NotChecked=170, Total=7656 [2024-11-13 13:13:55,338 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1292 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:55,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 1543 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1836 Invalid, 0 Unknown, 385 Unchecked, 1.3s Time] [2024-11-13 13:13:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-13 13:13:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 305. [2024-11-13 13:13:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 276 states have (on average 1.2789855072463767) internal successors, (353), 303 states have internal predecessors, (353), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 358 transitions. [2024-11-13 13:13:55,348 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 358 transitions. Word has length 43 [2024-11-13 13:13:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:55,348 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 358 transitions. [2024-11-13 13:13:55,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 41 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 358 transitions. [2024-11-13 13:13:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 13:13:55,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:55,352 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:55,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:13:55,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 13:13:55,553 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:13:55,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash 101109785, now seen corresponding path program 1 times [2024-11-13 13:13:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:55,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070306010] [2024-11-13 13:13:55,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:55,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:56,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070306010] [2024-11-13 13:13:56,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070306010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:56,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426455449] [2024-11-13 13:13:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:56,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:56,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:56,407 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:56,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:13:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:56,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 13:13:56,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:56,658 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:13:56,789 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:13:56,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:13:56,868 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:13:57,025 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:57,026 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 34 treesize of output 33 [2024-11-13 13:13:57,199 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:13:57,199 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:13:57,254 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:57,254 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 34 treesize of output 33 [2024-11-13 13:13:57,553 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-13 13:13:57,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-13 13:13:57,606 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 25 [2024-11-13 13:13:57,633 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 25 [2024-11-13 13:13:57,650 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 25 [2024-11-13 13:13:57,691 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 25 treesize of output 13 [2024-11-13 13:13:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:57,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:14:01,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:01,119 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 44 treesize of output 37 [2024-11-13 13:14:01,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:01,134 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 236 treesize of output 223 [2024-11-13 13:14:01,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 172 treesize of output 164 [2024-11-13 13:14:01,152 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 164 treesize of output 160 [2024-11-13 13:14:01,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:01,168 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 160 treesize of output 158 [2024-11-13 13:15:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426455449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:15:03,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:15:03,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 40 [2024-11-13 13:15:03,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833794238] [2024-11-13 13:15:03,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:15:03,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 13:15:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:03,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 13:15:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1409, Unknown=31, NotChecked=0, Total=1640 [2024-11-13 13:15:03,862 INFO L87 Difference]: Start difference. First operand 305 states and 358 transitions. Second operand has 41 states, 40 states have (on average 3.225) internal successors, (129), 41 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:09,279 INFO L93 Difference]: Finished difference Result 375 states and 431 transitions. [2024-11-13 13:15:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:15:09,279 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.225) internal successors, (129), 41 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-13 13:15:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:09,280 INFO L225 Difference]: With dead ends: 375 [2024-11-13 13:15:09,280 INFO L226 Difference]: Without dead ends: 375 [2024-11-13 13:15:09,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 56.0s TimeCoverageRelationStatistics Valid=393, Invalid=2228, Unknown=31, NotChecked=0, Total=2652 [2024-11-13 13:15:09,281 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 610 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:09,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1345 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-13 13:15:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-13 13:15:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 314. [2024-11-13 13:15:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 285 states have (on average 1.2771929824561403) internal successors, (364), 312 states have internal predecessors, (364), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 369 transitions. [2024-11-13 13:15:09,288 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 369 transitions. Word has length 45 [2024-11-13 13:15:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:09,288 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 369 transitions. [2024-11-13 13:15:09,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.225) internal successors, (129), 41 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 369 transitions. [2024-11-13 13:15:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 13:15:09,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:09,290 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:09,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:15:09,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-13 13:15:09,494 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:15:09,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash 101109786, now seen corresponding path program 1 times [2024-11-13 13:15:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:09,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244000859] [2024-11-13 13:15:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244000859] [2024-11-13 13:15:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244000859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833937438] [2024-11-13 13:15:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:10,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:10,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:10,908 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:10,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:15:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:11,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 13:15:11,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:11,184 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:15:11,312 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:15:11,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:15:11,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:15:11,484 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:15:11,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:15:11,708 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:15:11,708 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 59 treesize of output 52 [2024-11-13 13:15:11,721 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:15:11,920 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:15:11,920 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 42 treesize of output 31 [2024-11-13 13:15:11,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:11,936 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:15:12,031 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:15:12,032 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 59 treesize of output 52 [2024-11-13 13:15:12,061 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:15:12,486 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 13:15:12,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-13 13:15:12,507 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-13 13:15:12,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-13 13:15:12,559 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:15:12,565 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 25 [2024-11-13 13:15:12,583 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 25 [2024-11-13 13:15:12,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:15:12,605 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 25 [2024-11-13 13:15:12,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:15:12,683 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 25 treesize of output 13 [2024-11-13 13:15:12,690 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:15:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:12,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:15,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:15,361 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 41 treesize of output 42 [2024-11-13 13:15:15,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:15,371 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 33 treesize of output 34 [2024-11-13 13:15:15,376 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 13:15:15,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:15:15,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:15,397 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 186 treesize of output 181 [2024-11-13 13:15:15,416 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 64 treesize of output 62 [2024-11-13 13:15:15,424 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 62 treesize of output 58 [2024-11-13 13:15:15,432 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 86 treesize of output 80 [2024-11-13 13:15:15,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:15,588 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 82 treesize of output 83 [2024-11-13 13:15:15,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:15,600 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 74 treesize of output 59 [2024-11-13 13:15:15,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:15:15,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:15,626 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 728 treesize of output 663 [2024-11-13 13:15:15,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:15:15,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:15,678 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 2071 treesize of output 1982 [2024-11-13 13:15:15,746 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 619 treesize of output 595 [2024-11-13 13:15:15,763 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 595 treesize of output 571 [2024-11-13 13:15:15,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:15,791 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 571 treesize of output 527 [2024-11-13 13:15:15,807 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 519 treesize of output 511 [2024-11-13 13:15:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833937438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:15:17,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:15:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 42 [2024-11-13 13:15:17,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627804620] [2024-11-13 13:15:17,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:15:17,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 13:15:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 13:15:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1600, Unknown=21, NotChecked=0, Total=1806 [2024-11-13 13:15:17,404 INFO L87 Difference]: Start difference. First operand 314 states and 369 transitions. Second operand has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:21,833 INFO L93 Difference]: Finished difference Result 374 states and 430 transitions. [2024-11-13 13:15:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:15:21,834 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-13 13:15:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:21,835 INFO L225 Difference]: With dead ends: 374 [2024-11-13 13:15:21,835 INFO L226 Difference]: Without dead ends: 374 [2024-11-13 13:15:21,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=456, Invalid=2715, Unknown=21, NotChecked=0, Total=3192 [2024-11-13 13:15:21,836 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 813 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:21,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1525 Invalid, 2551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 13:15:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-13 13:15:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 314. [2024-11-13 13:15:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 285 states have (on average 1.2736842105263158) internal successors, (363), 312 states have internal predecessors, (363), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 368 transitions. [2024-11-13 13:15:21,843 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 368 transitions. Word has length 45 [2024-11-13 13:15:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:21,843 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 368 transitions. [2024-11-13 13:15:21,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 368 transitions. [2024-11-13 13:15:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 13:15:21,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:21,844 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-13 13:15:21,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:15:22,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 13:15:22,049 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:15:22,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:22,049 INFO L85 PathProgramCache]: Analyzing trace with hash -486726328, now seen corresponding path program 2 times [2024-11-13 13:15:22,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:22,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400645742] [2024-11-13 13:15:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400645742] [2024-11-13 13:15:23,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400645742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388859213] [2024-11-13 13:15:23,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:15:23,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:23,029 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:23,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:15:23,237 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:15:23,237 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:15:23,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 13:15:23,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:23,247 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:15:23,359 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:15:23,359 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:15:23,435 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:15:23,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:15:23,661 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:15:23,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-13 13:15:23,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 24 treesize of output 11 [2024-11-13 13:15:23,711 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 15 treesize of output 7 [2024-11-13 13:15:23,855 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:15:23,855 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:15:23,921 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:15:23,921 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:15:23,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:15:23,965 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:15:24,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:15:24,049 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-13 13:15:24,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2024-11-13 13:15:24,130 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 15 treesize of output 7 [2024-11-13 13:15:24,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:24,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:24,211 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2024-11-13 13:15:24,532 INFO L349 Elim1Store]: treesize reduction 65, result has 26.1 percent of original size [2024-11-13 13:15:24,532 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 66 [2024-11-13 13:15:24,545 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 7 [2024-11-13 13:15:24,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:24,565 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 34 treesize of output 24 [2024-11-13 13:15:24,861 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-11-13 13:15:24,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 81 [2024-11-13 13:15:25,116 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 25 treesize of output 13 [2024-11-13 13:15:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:25,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:25,944 INFO L349 Elim1Store]: treesize reduction 5, result has 93.0 percent of original size [2024-11-13 13:15:25,944 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 75 treesize of output 74 [2024-11-13 13:15:26,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:26,452 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2024-11-13 13:15:27,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:27,516 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 218 treesize of output 131 [2024-11-13 13:15:27,599 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:15:27,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:27,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 319594 treesize of output 291538 [2024-11-13 13:15:28,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:28,237 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 2840 treesize of output 2616 [2024-11-13 13:15:28,327 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 1498 treesize of output 1418 [2024-11-13 13:15:28,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:28,386 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 1418 treesize of output 1302 [2024-11-13 13:15:28,459 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:15:28,459 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 13 treesize of output 12 [2024-11-13 13:15:28,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:28,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 13:15:28,624 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 30 treesize of output 22 [2024-11-13 13:15:28,720 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:15:40,477 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 104 treesize of output 98 [2024-11-13 13:15:40,584 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:15:40,626 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 42 treesize of output 38 [2024-11-13 13:15:40,650 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 13:15:40,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:40,687 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 108 treesize of output 100 [2024-11-13 13:15:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:41,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388859213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:15:41,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:15:41,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 54 [2024-11-13 13:15:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637252138] [2024-11-13 13:15:41,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:15:41,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-13 13:15:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:41,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-13 13:15:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2700, Unknown=46, NotChecked=0, Total=2970 [2024-11-13 13:15:41,379 INFO L87 Difference]: Start difference. First operand 314 states and 368 transitions. Second operand has 55 states, 54 states have (on average 2.3703703703703702) internal successors, (128), 55 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:15:46,485 INFO L93 Difference]: Finished difference Result 406 states and 464 transitions. [2024-11-13 13:15:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 13:15:46,486 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.3703703703703702) internal successors, (128), 55 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-13 13:15:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:15:46,487 INFO L225 Difference]: With dead ends: 406 [2024-11-13 13:15:46,487 INFO L226 Difference]: Without dead ends: 406 [2024-11-13 13:15:46,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=602, Invalid=4902, Unknown=46, NotChecked=0, Total=5550 [2024-11-13 13:15:46,489 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 754 mSDsluCounter, 2147 mSDsCounter, 0 mSdLazyCounter, 3268 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:15:46,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 2233 Invalid, 3398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3268 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 13:15:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-13 13:15:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 314. [2024-11-13 13:15:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 285 states have (on average 1.2701754385964912) internal successors, (362), 312 states have internal predecessors, (362), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 367 transitions. [2024-11-13 13:15:46,497 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 367 transitions. Word has length 45 [2024-11-13 13:15:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:15:46,497 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 367 transitions. [2024-11-13 13:15:46,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.3703703703703702) internal successors, (128), 55 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 367 transitions. [2024-11-13 13:15:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 13:15:46,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:15:46,498 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-13 13:15:46,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:15:46,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 13:15:46,699 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:15:46,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash -486726327, now seen corresponding path program 2 times [2024-11-13 13:15:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:46,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765264981] [2024-11-13 13:15:46,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765264981] [2024-11-13 13:15:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765264981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944754480] [2024-11-13 13:15:48,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:15:48,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:48,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:48,247 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:48,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:15:48,467 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:15:48,468 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:15:48,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-13 13:15:48,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:48,485 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:15:48,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:15:48,603 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:15:48,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:15:48,683 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:15:48,822 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:15:48,823 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 41 treesize of output 38 [2024-11-13 13:15:48,829 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:15:48,982 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:15:48,982 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:15:48,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:48,993 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:15:49,120 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:15:49,120 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:15:49,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:49,132 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:15:49,256 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:15:49,256 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 16 treesize of output 15 [2024-11-13 13:15:49,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:49,287 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 13:15:49,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 13:15:49,377 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-13 13:15:49,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2024-11-13 13:15:49,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:15:49,690 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-11-13 13:15:49,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 54 [2024-11-13 13:15:49,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:15:50,028 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:15:50,028 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:15:50,075 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-13 13:15:50,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 50 [2024-11-13 13:15:50,276 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-13 13:15:50,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 71 [2024-11-13 13:15:50,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2024-11-13 13:15:50,731 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 13:15:50,732 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2024-11-13 13:15:50,738 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:15:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:50,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:51,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_130| Int) (v_ArrVal_2087 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_130| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_130|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2087) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 9)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_130| Int) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2086 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_130| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_130|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2087) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2086) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_130|))))))) is different from false [2024-11-13 13:15:51,764 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2082 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_130| Int) (v_ArrVal_2087 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_130| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_130|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2082) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2083) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2087) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 9)))) (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2082 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_130| Int) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2086 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_130| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_130|) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2083))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2082) .cse0 v_ArrVal_2087) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2086) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)))))))) is different from false [2024-11-13 13:15:52,065 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (and (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_130| Int) (v_ArrVal_2087 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_130| 0) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2082) (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2083) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2087) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 9)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_130|))) (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2082 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_130| Int) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2086 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_130| 0) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2083))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2080) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2082) .cse1 v_ArrVal_2087) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2086) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_130|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_130|))))) is different from false [2024-11-13 13:15:52,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:52,434 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 226 treesize of output 230 [2024-11-13 13:15:52,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:52,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 207 [2024-11-13 13:15:52,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:52,462 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 195 [2024-11-13 13:15:55,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:55,945 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 567 treesize of output 560 [2024-11-13 13:15:55,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:55,963 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 551 treesize of output 376 [2024-11-13 13:15:56,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:56,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28419 treesize of output 24381 [2024-11-13 13:15:56,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:56,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 12671 treesize of output 12541 [2024-11-13 13:15:56,967 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 5528 treesize of output 5524 [2024-11-13 13:15:57,051 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 5524 treesize of output 5488 [2024-11-13 13:15:57,126 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 5488 treesize of output 5452 [2024-11-13 13:15:57,208 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 5452 treesize of output 5440 [2024-11-13 13:15:57,283 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 5440 treesize of output 5428 [2024-11-13 13:15:57,354 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 5428 treesize of output 5380 [2024-11-13 13:15:57,430 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 5380 treesize of output 5368 [2024-11-13 13:15:57,531 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 5368 treesize of output 5344 [2024-11-13 13:15:57,602 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 5344 treesize of output 5294 [2024-11-13 13:15:57,673 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 5294 treesize of output 5280 [2024-11-13 13:15:57,746 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 5280 treesize of output 5276 [2024-11-13 13:15:57,817 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 5276 treesize of output 5230 [2024-11-13 13:15:57,916 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 5230 treesize of output 5212 [2024-11-13 13:15:58,073 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 5212 treesize of output 5200 [2024-11-13 13:15:58,977 INFO L349 Elim1Store]: treesize reduction 4, result has 99.1 percent of original size [2024-11-13 13:15:58,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 5207 treesize of output 5601 [2024-11-13 13:15:59,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:59,799 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 5225 treesize of output 4863 [2024-11-13 13:15:59,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:59,998 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 4871 treesize of output 4521 [2024-11-13 13:16:00,149 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 4436 treesize of output 4336 [2024-11-13 13:16:00,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:16:00,322 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 4429 treesize of output 4139 [2024-11-13 13:16:00,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:16:00,509 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 4147 treesize of output 3989 [2024-11-13 13:16:00,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:16:00,687 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 3908 treesize of output 3831 [2024-11-13 13:16:00,866 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 3822 treesize of output 3776 [2024-11-13 13:16:01,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:16:01,091 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 3776 treesize of output 3653 [2024-11-13 13:19:15,985 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 13:19:15,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-13 13:19:15,987 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 13:19:16,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:19:16,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 13:19:16,188 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 78 more [2024-11-13 13:19:16,195 INFO L158 Benchmark]: Toolchain (without parser) took 380191.01ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 118.2MB in the beginning and 892.0MB in the end (delta: -773.8MB). Peak memory consumption was 898.4MB. Max. memory is 16.1GB. [2024-11-13 13:19:16,195 INFO L158 Benchmark]: CDTParser took 1.81ms. Allocated memory is still 142.6MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:19:16,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.53ms. Allocated memory is still 142.6MB. Free memory was 118.0MB in the beginning and 100.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:19:16,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.16ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:19:16,196 INFO L158 Benchmark]: Boogie Preprocessor took 71.33ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:19:16,196 INFO L158 Benchmark]: RCFGBuilder took 840.89ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 64.8MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:19:16,196 INFO L158 Benchmark]: TraceAbstraction took 378744.83ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 64.3MB in the beginning and 892.0MB in the end (delta: -827.7MB). Peak memory consumption was 848.0MB. Max. memory is 16.1GB. [2024-11-13 13:19:16,197 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.81ms. Allocated memory is still 142.6MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.53ms. Allocated memory is still 142.6MB. Free memory was 118.0MB in the beginning and 100.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.16ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.33ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 840.89ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 64.8MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 378744.83ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 64.3MB in the beginning and 892.0MB in the end (delta: -827.7MB). Peak memory consumption was 848.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/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_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/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 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:19:18,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:19:18,852 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 13:19:18,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:19:18,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:19:18,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:19:18,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:19:18,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:19:18,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:19:18,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:19:18,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:19:18,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:19:18,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:19:18,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:19:18,900 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:19:18,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:19:18,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:19:18,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:19:18,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:19:18,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:19:18,901 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:19:18,901 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:19:18,901 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:19:18,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:19:18,901 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:19:18,901 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:19:18,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:19:18,902 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:19:18,902 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:19:18,902 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:19:18,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:19:18,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:19:18,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:19:18,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:19:18,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:19:18,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:19:18,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:19:18,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:19:18,903 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:19:18,903 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:19:18,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:19:18,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:19:18,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:19:18,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:19:18,903 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_c8b0beea-17e7-44f7-a3da-a78328da157e/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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2024-11-13 13:19:19,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:19:19,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:19:19,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:19:19,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:19:19,342 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:19:19,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i Unable to find full path for "g++" [2024-11-13 13:19:21,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:19:21,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:19:21,644 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2024-11-13 13:19:21,656 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/data/c41d1b4cd/25e40a58a045452ca4129324baa438f1/FLAG9b7edefdd [2024-11-13 13:19:21,672 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/data/c41d1b4cd/25e40a58a045452ca4129324baa438f1 [2024-11-13 13:19:21,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:19:21,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:19:21,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:19:21,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:19:21,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:19:21,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:19:21" (1/1) ... [2024-11-13 13:19:21,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b7dffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:21, skipping insertion in model container [2024-11-13 13:19:21,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:19:21" (1/1) ... [2024-11-13 13:19:21,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:19:22,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:19:22,173 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:19:22,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:19:22,259 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:19:22,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22 WrapperNode [2024-11-13 13:19:22,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:19:22,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:19:22,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:19:22,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:19:22,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,305 INFO L138 Inliner]: procedures = 122, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 185 [2024-11-13 13:19:22,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:19:22,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:19:22,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:19:22,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:19:22,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,349 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-11-13 13:19:22,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:19:22,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:19:22,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:19:22,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:19:22,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (1/1) ... [2024-11-13 13:19:22,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:19:22,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:22,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:19:22,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:19:22,473 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-13 13:19:22,473 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-13 13:19:22,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 13:19:22,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 13:19:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:19:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:19:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:19:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:19:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:19:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:19:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:19:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 13:19:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 13:19:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:19:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 13:19:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:19:22,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:19:22,667 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:19:22,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:19:23,718 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-11-13 13:19:23,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:19:23,735 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:19:23,737 INFO L316 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-13 13:19:23,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:19:23 BoogieIcfgContainer [2024-11-13 13:19:23,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:19:23,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:19:23,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:19:23,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:19:23,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:19:21" (1/3) ... [2024-11-13 13:19:23,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75926384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:19:23, skipping insertion in model container [2024-11-13 13:19:23,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:19:22" (2/3) ... [2024-11-13 13:19:23,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75926384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:19:23, skipping insertion in model container [2024-11-13 13:19:23,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:19:23" (3/3) ... [2024-11-13 13:19:23,751 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2024-11-13 13:19:23,768 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:19:23,770 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-sorted-2.i that has 2 procedures, 184 locations, 1 initial locations, 12 loop locations, and 75 error locations. [2024-11-13 13:19:23,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:19:23,844 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;@34cb989b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:19:23,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2024-11-13 13:19:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 101 states have (on average 2.108910891089109) internal successors, (213), 176 states have internal predecessors, (213), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:19:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 13:19:23,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:23,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 13:19:23,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:23,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-13 13:19:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:23,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872205492] [2024-11-13 13:19:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:23,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:23,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:23,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:23,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:19:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:24,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:19:24,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:24,099 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 7 [2024-11-13 13:19:24,120 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 13:19:24,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:24,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872205492] [2024-11-13 13:19:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872205492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:24,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:19:24,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218387413] [2024-11-13 13:19:24,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:24,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:19:24,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:24,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:19:24,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:19:24,159 INFO L87 Difference]: Start difference. First operand has 184 states, 101 states have (on average 2.108910891089109) internal successors, (213), 176 states have internal predecessors, (213), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:24,531 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2024-11-13 13:19:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:19:24,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-13 13:19:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:24,540 INFO L225 Difference]: With dead ends: 173 [2024-11-13 13:19:24,540 INFO L226 Difference]: Without dead ends: 171 [2024-11-13 13:19:24,542 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 13:19:24,544 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 157 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:24,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 124 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:19:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-13 13:19:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-13 13:19:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 93 states have (on average 1.946236559139785) internal successors, (181), 169 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2024-11-13 13:19:24,584 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 3 [2024-11-13 13:19:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:24,585 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2024-11-13 13:19:24,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2024-11-13 13:19:24,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 13:19:24,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:24,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 13:19:24,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:19:24,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:24,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:24,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-13 13:19:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:24,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717806401] [2024-11-13 13:19:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:24,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:24,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:24,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:24,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:19:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:24,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:19:24,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:24,890 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:19:24,906 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 13:19:24,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:24,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717806401] [2024-11-13 13:19:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717806401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:24,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:24,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:19:24,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334497233] [2024-11-13 13:19:24,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:24,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:19:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:24,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:19:24,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:19:24,912 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:25,365 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2024-11-13 13:19:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:19:25,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-13 13:19:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:25,367 INFO L225 Difference]: With dead ends: 168 [2024-11-13 13:19:25,371 INFO L226 Difference]: Without dead ends: 168 [2024-11-13 13:19:25,371 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 13:19:25,372 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:25,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 120 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:19:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-13 13:19:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-13 13:19:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 93 states have (on average 1.913978494623656) internal successors, (178), 166 states have internal predecessors, (178), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2024-11-13 13:19:25,401 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 3 [2024-11-13 13:19:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:25,402 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2024-11-13 13:19:25,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2024-11-13 13:19:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:19:25,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:25,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:25,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:19:25,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:25,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:25,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:25,604 INFO L85 PathProgramCache]: Analyzing trace with hash 919163538, now seen corresponding path program 1 times [2024-11-13 13:19:25,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:25,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304789899] [2024-11-13 13:19:25,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:25,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:25,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:25,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:25,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:19:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:25,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:19:25,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:25,806 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-13 13:19:25,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 13:19:25,819 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 13:19:25,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:25,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:25,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304789899] [2024-11-13 13:19:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304789899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:25,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:19:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438032977] [2024-11-13 13:19:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:25,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:19:25,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:25,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:19:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:19:25,822 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:26,426 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2024-11-13 13:19:26,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:19:26,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 13:19:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:26,428 INFO L225 Difference]: With dead ends: 166 [2024-11-13 13:19:26,428 INFO L226 Difference]: Without dead ends: 166 [2024-11-13 13:19:26,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:19:26,432 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 245 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:26,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 95 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:19:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-13 13:19:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-11-13 13:19:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.7289719626168225) internal successors, (185), 162 states have internal predecessors, (185), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2024-11-13 13:19:26,449 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 9 [2024-11-13 13:19:26,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:26,449 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2024-11-13 13:19:26,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2024-11-13 13:19:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:19:26,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:26,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:26,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:19:26,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:26,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:26,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash 919163539, now seen corresponding path program 1 times [2024-11-13 13:19:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169134634] [2024-11-13 13:19:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:26,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:26,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:26,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:26,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:19:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:26,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:19:26,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:26,778 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:19:26,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:19:26,978 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:19:26,993 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:19:26,993 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 13 treesize of output 13 [2024-11-13 13:19:27,017 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 13:19:27,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:27,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169134634] [2024-11-13 13:19:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169134634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:19:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751148215] [2024-11-13 13:19:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:27,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:19:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:19:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:19:27,019 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:28,091 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2024-11-13 13:19:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:19:28,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 13:19:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:28,093 INFO L225 Difference]: With dead ends: 236 [2024-11-13 13:19:28,093 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 13:19:28,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:19:28,095 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 520 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:28,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 186 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 13:19:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 13:19:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 217. [2024-11-13 13:19:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 160 states have (on average 1.625) internal successors, (260), 215 states have internal predecessors, (260), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 266 transitions. [2024-11-13 13:19:28,108 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 266 transitions. Word has length 9 [2024-11-13 13:19:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:28,108 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 266 transitions. [2024-11-13 13:19:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 266 transitions. [2024-11-13 13:19:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 13:19:28,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:28,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:28,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:19:28,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:28,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:28,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash 884859318, now seen corresponding path program 1 times [2024-11-13 13:19:28,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:28,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258063569] [2024-11-13 13:19:28,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:28,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:28,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:28,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:28,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:19:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:28,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:19:28,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:28,430 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 13:19:28,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:28,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258063569] [2024-11-13 13:19:28,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258063569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:28,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:28,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:19:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749655163] [2024-11-13 13:19:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:28,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:19:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:19:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:19:28,437 INFO L87 Difference]: Start difference. First operand 217 states and 266 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13:19:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:28,476 INFO L93 Difference]: Finished difference Result 263 states and 315 transitions. [2024-11-13 13:19:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:19:28,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-13 13:19:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:28,478 INFO L225 Difference]: With dead ends: 263 [2024-11-13 13:19:28,478 INFO L226 Difference]: Without dead ends: 263 [2024-11-13 13:19:28,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 13:19:28,479 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 56 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:28,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 341 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:19:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-13 13:19:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 230. [2024-11-13 13:19:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 173 states have (on average 1.6184971098265897) internal successors, (280), 228 states have internal predecessors, (280), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2024-11-13 13:19:28,490 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 13 [2024-11-13 13:19:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:28,490 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2024-11-13 13:19:28,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13:19:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2024-11-13 13:19:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:19:28,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:28,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:28,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:19:28,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:28,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:28,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514731, now seen corresponding path program 1 times [2024-11-13 13:19:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:28,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733430247] [2024-11-13 13:19:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:28,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:28,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:28,695 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:28,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:19:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:28,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:19:28,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:28,805 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 7 [2024-11-13 13:19:28,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:19:28,851 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 19 treesize of output 11 [2024-11-13 13:19:28,863 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 13:19:28,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:28,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733430247] [2024-11-13 13:19:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733430247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:28,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:28,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:19:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855238096] [2024-11-13 13:19:28,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:28,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:19:28,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:28,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:19:28,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:19:28,865 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:29,500 INFO L93 Difference]: Finished difference Result 229 states and 283 transitions. [2024-11-13 13:19:29,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:19:29,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 13:19:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:29,502 INFO L225 Difference]: With dead ends: 229 [2024-11-13 13:19:29,502 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 13:19:29,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:19:29,503 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 4 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:29,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 434 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:19:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 13:19:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-13 13:19:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 173 states have (on average 1.6011560693641618) internal successors, (277), 227 states have internal predecessors, (277), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 283 transitions. [2024-11-13 13:19:29,533 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 283 transitions. Word has length 12 [2024-11-13 13:19:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:29,536 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 283 transitions. [2024-11-13 13:19:29,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 283 transitions. [2024-11-13 13:19:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:19:29,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:29,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:29,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:19:29,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:29,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:29,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514730, now seen corresponding path program 1 times [2024-11-13 13:19:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:29,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1722614964] [2024-11-13 13:19:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:29,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:29,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:29,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:29,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:19:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:29,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 13:19:29,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:29,855 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:19:29,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:19:29,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:19:29,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 13:19:29,971 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 13:19:29,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:29,971 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722614964] [2024-11-13 13:19:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722614964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:29,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:29,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:19:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032907953] [2024-11-13 13:19:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:29,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:19:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:29,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:19:29,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:19:29,973 INFO L87 Difference]: Start difference. First operand 229 states and 283 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:30,711 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2024-11-13 13:19:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:19:30,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 13:19:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:30,713 INFO L225 Difference]: With dead ends: 228 [2024-11-13 13:19:30,713 INFO L226 Difference]: Without dead ends: 228 [2024-11-13 13:19:30,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:19:30,714 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:30,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 414 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:19:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-13 13:19:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-13 13:19:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 173 states have (on average 1.583815028901734) internal successors, (274), 226 states have internal predecessors, (274), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2024-11-13 13:19:30,721 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 12 [2024-11-13 13:19:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:30,722 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2024-11-13 13:19:30,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2024-11-13 13:19:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:19:30,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:30,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:30,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:19:30,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:30,923 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:30,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547560, now seen corresponding path program 1 times [2024-11-13 13:19:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:30,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143449956] [2024-11-13 13:19:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:30,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:30,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:30,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:30,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:19:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:31,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:19:31,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:31,096 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 7 [2024-11-13 13:19:31,144 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:19:31,163 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:19:31,163 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 13 treesize of output 13 [2024-11-13 13:19:31,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:19:31,232 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:19:31,364 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:19:31,365 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 50 treesize of output 45 [2024-11-13 13:19:31,377 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:19:31,458 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 25 treesize of output 13 [2024-11-13 13:19:31,475 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:19:31,530 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 13:19:31,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:31,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143449956] [2024-11-13 13:19:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143449956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:31,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:31,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:19:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207209814] [2024-11-13 13:19:31,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:31,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:19:31,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:31,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:19:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:19:31,532 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:33,377 INFO L93 Difference]: Finished difference Result 222 states and 270 transitions. [2024-11-13 13:19:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:19:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:19:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:33,379 INFO L225 Difference]: With dead ends: 222 [2024-11-13 13:19:33,379 INFO L226 Difference]: Without dead ends: 222 [2024-11-13 13:19:33,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:19:33,380 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 244 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:33,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 409 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 13:19:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-13 13:19:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 214. [2024-11-13 13:19:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 165 states have (on average 1.5515151515151515) internal successors, (256), 212 states have internal predecessors, (256), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2024-11-13 13:19:33,387 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 16 [2024-11-13 13:19:33,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:33,387 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2024-11-13 13:19:33,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2024-11-13 13:19:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:19:33,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:33,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:19:33,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:19:33,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:33,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:33,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547561, now seen corresponding path program 1 times [2024-11-13 13:19:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752979076] [2024-11-13 13:19:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:33,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:33,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:33,590 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:33,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:19:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:33,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 13:19:33,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:33,696 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 7 [2024-11-13 13:19:33,751 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 13:19:33,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 13:19:33,817 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:19:33,919 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:19:33,920 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 35 [2024-11-13 13:19:33,952 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 27 treesize of output 15 [2024-11-13 13:19:34,047 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 13:19:34,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:34,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752979076] [2024-11-13 13:19:34,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752979076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:34,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:34,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:19:34,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926322263] [2024-11-13 13:19:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:34,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:19:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:34,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:19:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:19:34,049 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:35,184 INFO L93 Difference]: Finished difference Result 217 states and 262 transitions. [2024-11-13 13:19:35,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:19:35,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:19:35,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:35,186 INFO L225 Difference]: With dead ends: 217 [2024-11-13 13:19:35,186 INFO L226 Difference]: Without dead ends: 217 [2024-11-13 13:19:35,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:19:35,187 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 311 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:35,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 319 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 13:19:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-13 13:19:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2024-11-13 13:19:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 165 states have (on average 1.5393939393939393) internal successors, (254), 211 states have internal predecessors, (254), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 260 transitions. [2024-11-13 13:19:35,194 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 260 transitions. Word has length 16 [2024-11-13 13:19:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:35,194 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 260 transitions. [2024-11-13 13:19:35,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 260 transitions. [2024-11-13 13:19:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:19:35,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:35,195 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 13:19:35,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:19:35,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:35,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:35,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash -327063291, now seen corresponding path program 1 times [2024-11-13 13:19:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947999800] [2024-11-13 13:19:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:35,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:35,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:35,398 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:35,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:19:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:35,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:19:35,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:19:35,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:19:35,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:35,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947999800] [2024-11-13 13:19:35,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947999800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:19:35,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:19:35,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:19:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933951076] [2024-11-13 13:19:35,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:19:35,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:19:35,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:35,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:19:35,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:19:35,590 INFO L87 Difference]: Start difference. First operand 213 states and 260 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 13:19:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:35,981 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions. [2024-11-13 13:19:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:19:35,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2024-11-13 13:19:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:35,982 INFO L225 Difference]: With dead ends: 236 [2024-11-13 13:19:35,982 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 13:19:35,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:19:35,983 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 265 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:35,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 213 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:19:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 13:19:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 212. [2024-11-13 13:19:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 165 states have (on average 1.5212121212121212) internal successors, (251), 210 states have internal predecessors, (251), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 256 transitions. [2024-11-13 13:19:35,990 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 256 transitions. Word has length 27 [2024-11-13 13:19:35,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:35,990 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 256 transitions. [2024-11-13 13:19:35,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 13:19:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 256 transitions. [2024-11-13 13:19:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 13:19:35,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:35,991 INFO L215 NwaCegarLoop]: trace histogram [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:19:36,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:19:36,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:36,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:36,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 618214329, now seen corresponding path program 1 times [2024-11-13 13:19:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810577094] [2024-11-13 13:19:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:36,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:36,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:36,198 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:36,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:19:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:36,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 13:19:36,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:36,332 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 7 [2024-11-13 13:19:36,425 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 13:19:36,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 13:19:36,506 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:19:36,672 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:19:36,673 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 35 [2024-11-13 13:19:36,830 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:19:36,831 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 35 treesize of output 26 [2024-11-13 13:19:36,915 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:19:36,915 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 35 [2024-11-13 13:19:37,074 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 27 treesize of output 15 [2024-11-13 13:19:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:19:37,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:19:37,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-13 13:19:37,339 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_317)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-13 13:19:37,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_317)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-13 13:19:37,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:37,370 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 40 treesize of output 33 [2024-11-13 13:19:37,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:37,390 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 268 treesize of output 243 [2024-11-13 13:19:37,405 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 187 treesize of output 179 [2024-11-13 13:19:37,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:37,426 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 179 treesize of output 175 [2024-11-13 13:19:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:19:52,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810577094] [2024-11-13 13:19:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810577094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:19:52,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:19:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-11-13 13:19:52,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793880421] [2024-11-13 13:19:52,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:19:52,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 13:19:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 13:19:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=289, Unknown=17, NotChecked=114, Total=506 [2024-11-13 13:19:52,196 INFO L87 Difference]: Start difference. First operand 212 states and 256 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:19:55,422 INFO L93 Difference]: Finished difference Result 319 states and 363 transitions. [2024-11-13 13:19:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:19:55,423 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 13:19:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:19:55,425 INFO L225 Difference]: With dead ends: 319 [2024-11-13 13:19:55,425 INFO L226 Difference]: Without dead ends: 319 [2024-11-13 13:19:55,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=100, Invalid=315, Unknown=17, NotChecked=120, Total=552 [2024-11-13 13:19:55,426 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 291 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 953 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:19:55,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 992 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1153 Invalid, 0 Unknown, 953 Unchecked, 3.1s Time] [2024-11-13 13:19:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-13 13:19:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 237. [2024-11-13 13:19:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 235 states have internal predecessors, (281), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 286 transitions. [2024-11-13 13:19:55,433 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 286 transitions. Word has length 31 [2024-11-13 13:19:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:19:55,433 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 286 transitions. [2024-11-13 13:19:55,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 286 transitions. [2024-11-13 13:19:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 13:19:55,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:19:55,434 INFO L215 NwaCegarLoop]: trace histogram [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:19:55,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:19:55,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:55,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:19:55,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:19:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash 618214330, now seen corresponding path program 1 times [2024-11-13 13:19:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:19:55,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228531234] [2024-11-13 13:19:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:19:55,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:19:55,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:19:55,637 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:19:55,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:19:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:19:55,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 13:19:55,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:19:55,780 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 7 [2024-11-13 13:19:55,848 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:19:55,848 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 13 treesize of output 13 [2024-11-13 13:19:55,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:19:55,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:19:55,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:19:56,087 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:19:56,088 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 50 treesize of output 45 [2024-11-13 13:19:56,099 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:19:56,286 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:19:56,287 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:19:56,296 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:19:56,323 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:19:56,324 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:19:56,445 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:19:56,445 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 50 treesize of output 45 [2024-11-13 13:19:56,452 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:19:56,617 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 25 treesize of output 13 [2024-11-13 13:19:56,627 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:19:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:19:56,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:19:56,983 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))))) is different from false [2024-11-13 13:19:57,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_374) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-13 13:19:57,374 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_370) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_371))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_370) .cse1 v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_374) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-13 13:19:57,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_371))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_370) .cse1 v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_374) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_370) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_371) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-13 13:19:57,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:57,458 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 73 treesize of output 66 [2024-11-13 13:19:57,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:57,469 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 57 treesize of output 50 [2024-11-13 13:19:57,475 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 84 treesize of output 72 [2024-11-13 13:19:57,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:57,519 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 232 treesize of output 215 [2024-11-13 13:19:57,539 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 78 treesize of output 74 [2024-11-13 13:19:57,546 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 108 treesize of output 96 [2024-11-13 13:19:57,562 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 66 treesize of output 62 [2024-11-13 13:19:57,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:57,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-13 13:19:57,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:57,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-13 13:19:57,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:19:57,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:19:57,731 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-13 13:19:57,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:19:57,740 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-13 13:19:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:19:57,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:19:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228531234] [2024-11-13 13:19:57,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228531234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:19:57,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:19:57,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2024-11-13 13:19:57,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36388983] [2024-11-13 13:19:57,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:19:57,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:19:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:19:57,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:19:57,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=247, Unknown=13, NotChecked=140, Total=462 [2024-11-13 13:19:57,964 INFO L87 Difference]: Start difference. First operand 237 states and 286 transitions. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:01,942 INFO L93 Difference]: Finished difference Result 310 states and 354 transitions. [2024-11-13 13:20:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:20:01,943 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 13:20:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:01,944 INFO L225 Difference]: With dead ends: 310 [2024-11-13 13:20:01,944 INFO L226 Difference]: Without dead ends: 310 [2024-11-13 13:20:01,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=474, Unknown=15, NotChecked=196, Total=812 [2024-11-13 13:20:01,945 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 581 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1210 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:01,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 745 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 977 Invalid, 0 Unknown, 1210 Unchecked, 3.4s Time] [2024-11-13 13:20:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-13 13:20:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 237. [2024-11-13 13:20:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 235 states have internal predecessors, (280), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2024-11-13 13:20:01,952 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 31 [2024-11-13 13:20:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:01,953 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2024-11-13 13:20:01,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2024-11-13 13:20:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:20:01,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:01,954 INFO L215 NwaCegarLoop]: trace histogram [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:20:01,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:20:02,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:02,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:02,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1407226440, now seen corresponding path program 1 times [2024-11-13 13:20:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117786522] [2024-11-13 13:20:02,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:02,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:02,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:02,158 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:02,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:20:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:02,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:20:02,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:20:02,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:02,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:02,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117786522] [2024-11-13 13:20:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117786522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:02,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:02,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342452003] [2024-11-13 13:20:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:02,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:02,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:02,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:02,293 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:02,314 INFO L93 Difference]: Finished difference Result 239 states and 287 transitions. [2024-11-13 13:20:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:02,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 13:20:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:02,316 INFO L225 Difference]: With dead ends: 239 [2024-11-13 13:20:02,316 INFO L226 Difference]: Without dead ends: 239 [2024-11-13 13:20:02,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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 13:20:02,316 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:02,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:20:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-13 13:20:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-13 13:20:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 192 states have (on average 1.46875) internal successors, (282), 237 states have internal predecessors, (282), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2024-11-13 13:20:02,323 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 33 [2024-11-13 13:20:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:02,323 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2024-11-13 13:20:02,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2024-11-13 13:20:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:20:02,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:02,325 INFO L215 NwaCegarLoop]: trace histogram [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:20:02,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:20:02,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:02,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:02,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1107573533, now seen corresponding path program 1 times [2024-11-13 13:20:02,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:02,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166273547] [2024-11-13 13:20:02,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:02,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:02,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:02,528 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:02,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:20:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:02,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 13:20:02,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:02,673 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 7 [2024-11-13 13:20:02,744 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:20:02,765 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:02,765 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 13 treesize of output 13 [2024-11-13 13:20:02,815 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:20:02,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:20:02,996 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:02,996 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 50 treesize of output 45 [2024-11-13 13:20:03,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 24 treesize of output 11 [2024-11-13 13:20:03,177 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:20:03,177 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:20:03,185 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:20:03,215 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:20:03,215 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:20:03,334 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:03,334 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 50 treesize of output 45 [2024-11-13 13:20:03,344 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:20:03,551 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 25 treesize of output 13 [2024-11-13 13:20:03,557 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:20:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:03,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:04,031 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-13 13:20:04,113 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-13 13:20:04,477 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_475) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_474) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_474))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_475) .cse1 v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_478) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-13 13:20:05,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:05,144 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 71 treesize of output 64 [2024-11-13 13:20:05,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:05,157 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 55 treesize of output 48 [2024-11-13 13:20:05,163 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 80 treesize of output 68 [2024-11-13 13:20:05,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:05,197 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 128 treesize of output 119 [2024-11-13 13:20:05,212 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 74 treesize of output 66 [2024-11-13 13:20:05,236 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 66 treesize of output 62 [2024-11-13 13:20:05,242 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 92 treesize of output 80 [2024-11-13 13:20:05,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:05,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-13 13:20:05,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:05,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-13 13:20:05,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:20:05,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:20:05,429 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-13 13:20:05,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:20:05,437 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-13 13:20:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:08,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166273547] [2024-11-13 13:20:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166273547] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:08,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:08,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-11-13 13:20:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35825138] [2024-11-13 13:20:08,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:08,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 13:20:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:08,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 13:20:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=338, Unknown=24, NotChecked=120, Total=552 [2024-11-13 13:20:08,098 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:15,790 INFO L93 Difference]: Finished difference Result 355 states and 405 transitions. [2024-11-13 13:20:15,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:20:15,791 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:20:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:15,792 INFO L225 Difference]: With dead ends: 355 [2024-11-13 13:20:15,792 INFO L226 Difference]: Without dead ends: 355 [2024-11-13 13:20:15,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=217, Invalid=1020, Unknown=35, NotChecked=210, Total=1482 [2024-11-13 13:20:15,793 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 857 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1031 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:15,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1059 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1506 Invalid, 0 Unknown, 1031 Unchecked, 6.3s Time] [2024-11-13 13:20:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-13 13:20:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 227. [2024-11-13 13:20:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 187 states have (on average 1.427807486631016) internal successors, (267), 225 states have internal predecessors, (267), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2024-11-13 13:20:15,801 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 36 [2024-11-13 13:20:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:15,801 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2024-11-13 13:20:15,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:15,802 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2024-11-13 13:20:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:20:15,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:15,805 INFO L215 NwaCegarLoop]: trace histogram [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:20:15,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 13:20:16,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:16,006 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:16,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:16,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1107573532, now seen corresponding path program 1 times [2024-11-13 13:20:16,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:16,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701071160] [2024-11-13 13:20:16,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:16,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:16,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:16,008 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:16,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 13:20:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:16,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:20:16,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:16,170 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 19 treesize of output 11 [2024-11-13 13:20:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:20:16,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:16,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:16,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701071160] [2024-11-13 13:20:16,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701071160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:16,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:16,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:20:16,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194688852] [2024-11-13 13:20:16,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:16,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:20:16,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:16,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:20:16,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:16,195 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:17,164 INFO L93 Difference]: Finished difference Result 245 states and 296 transitions. [2024-11-13 13:20:17,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:20:17,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:20:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:17,166 INFO L225 Difference]: With dead ends: 245 [2024-11-13 13:20:17,166 INFO L226 Difference]: Without dead ends: 245 [2024-11-13 13:20:17,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:20:17,167 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 83 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:17,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 359 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:20:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-13 13:20:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 225. [2024-11-13 13:20:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 186 states have (on average 1.4193548387096775) internal successors, (264), 223 states have internal predecessors, (264), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2024-11-13 13:20:17,173 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 36 [2024-11-13 13:20:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:17,174 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2024-11-13 13:20:17,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2024-11-13 13:20:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:20:17,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:17,175 INFO L215 NwaCegarLoop]: trace histogram [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:20:17,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 13:20:17,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:17,375 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:17,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2000755810, now seen corresponding path program 1 times [2024-11-13 13:20:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:17,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739875189] [2024-11-13 13:20:17,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:17,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:17,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:17,378 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:17,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 13:20:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:17,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:20:17,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:17,501 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 7 [2024-11-13 13:20:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:20:17,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:17,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:17,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739875189] [2024-11-13 13:20:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739875189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:17,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:17,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:20:17,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397060386] [2024-11-13 13:20:17,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:17,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:17,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:17,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:17,510 INFO L87 Difference]: Start difference. First operand 225 states and 269 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:17,749 INFO L93 Difference]: Finished difference Result 221 states and 262 transitions. [2024-11-13 13:20:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:17,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:20:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:17,750 INFO L225 Difference]: With dead ends: 221 [2024-11-13 13:20:17,750 INFO L226 Difference]: Without dead ends: 221 [2024-11-13 13:20:17,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 13:20:17,751 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:17,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 212 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:20:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-13 13:20:17,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-13 13:20:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 186 states have (on average 1.381720430107527) internal successors, (257), 219 states have internal predecessors, (257), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 262 transitions. [2024-11-13 13:20:17,757 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 262 transitions. Word has length 36 [2024-11-13 13:20:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:17,758 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 262 transitions. [2024-11-13 13:20:17,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 262 transitions. [2024-11-13 13:20:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:20:17,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:17,758 INFO L215 NwaCegarLoop]: trace histogram [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:20:17,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 13:20:17,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:17,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:17,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:17,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2000755809, now seen corresponding path program 1 times [2024-11-13 13:20:17,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:17,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158052753] [2024-11-13 13:20:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:17,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:17,963 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:17,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 13:20:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:18,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:20:18,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:20:18,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:18,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158052753] [2024-11-13 13:20:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158052753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:18,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:18,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:20:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12214304] [2024-11-13 13:20:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:18,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:20:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:18,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:20:18,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:20:18,256 INFO L87 Difference]: Start difference. First operand 221 states and 262 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:19,071 INFO L93 Difference]: Finished difference Result 236 states and 278 transitions. [2024-11-13 13:20:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:20:19,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:20:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:19,073 INFO L225 Difference]: With dead ends: 236 [2024-11-13 13:20:19,073 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 13:20:19,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:20:19,073 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 16 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:19,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 600 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:20:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 13:20:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 229. [2024-11-13 13:20:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 194 states have (on average 1.365979381443299) internal successors, (265), 227 states have internal predecessors, (265), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 270 transitions. [2024-11-13 13:20:19,079 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 270 transitions. Word has length 36 [2024-11-13 13:20:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:19,079 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 270 transitions. [2024-11-13 13:20:19,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 270 transitions. [2024-11-13 13:20:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:20:19,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:19,081 INFO L215 NwaCegarLoop]: trace histogram [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:20:19,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-13 13:20:19,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:19,282 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:19,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:19,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2000696227, now seen corresponding path program 1 times [2024-11-13 13:20:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:19,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023338873] [2024-11-13 13:20:19,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:19,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:19,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:19,285 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:19,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 13:20:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:19,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:20:19,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:19,443 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:20:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:20:19,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:19,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:19,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023338873] [2024-11-13 13:20:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023338873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:19,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:19,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:20:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72759079] [2024-11-13 13:20:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:19,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:19,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:19,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:19,458 INFO L87 Difference]: Start difference. First operand 229 states and 270 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:19,764 INFO L93 Difference]: Finished difference Result 225 states and 263 transitions. [2024-11-13 13:20:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 13:20:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:19,766 INFO L225 Difference]: With dead ends: 225 [2024-11-13 13:20:19,766 INFO L226 Difference]: Without dead ends: 225 [2024-11-13 13:20:19,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 13:20:19,767 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 15 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:19,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 208 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:20:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-13 13:20:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-13 13:20:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 194 states have (on average 1.3298969072164948) internal successors, (258), 223 states have internal predecessors, (258), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 263 transitions. [2024-11-13 13:20:19,772 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 263 transitions. Word has length 36 [2024-11-13 13:20:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:19,772 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 263 transitions. [2024-11-13 13:20:19,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 263 transitions. [2024-11-13 13:20:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:20:19,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:19,773 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-13 13:20:19,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 13:20:19,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:19,974 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:19,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash -18398360, now seen corresponding path program 1 times [2024-11-13 13:20:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149476304] [2024-11-13 13:20:19,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:19,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:19,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:19,976 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:19,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 13:20:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:20,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:20:20,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:20,155 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 19 treesize of output 11 [2024-11-13 13:20:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:20:20,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:20,180 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:20,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149476304] [2024-11-13 13:20:20,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149476304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:20,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:20,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:20:20,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180942124] [2024-11-13 13:20:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:20,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:20:20,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:20,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:20:20,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:20,181 INFO L87 Difference]: Start difference. First operand 225 states and 263 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:21,321 INFO L93 Difference]: Finished difference Result 241 states and 283 transitions. [2024-11-13 13:20:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:20:21,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-13 13:20:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:21,323 INFO L225 Difference]: With dead ends: 241 [2024-11-13 13:20:21,323 INFO L226 Difference]: Without dead ends: 241 [2024-11-13 13:20:21,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:20:21,324 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 72 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:21,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 333 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 13:20:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-13 13:20:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2024-11-13 13:20:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 200 states have (on average 1.335) internal successors, (267), 229 states have internal predecessors, (267), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2024-11-13 13:20:21,330 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 40 [2024-11-13 13:20:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:21,330 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2024-11-13 13:20:21,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2024-11-13 13:20:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:20:21,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:21,331 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-13 13:20:21,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 13:20:21,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:21,532 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:21,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -18398359, now seen corresponding path program 1 times [2024-11-13 13:20:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:21,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786605025] [2024-11-13 13:20:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:21,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:21,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:21,534 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:21,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 13:20:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:21,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:20:21,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:21,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 13:20:21,805 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 34 treesize of output 18 [2024-11-13 13:20:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:20:21,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:21,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:21,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786605025] [2024-11-13 13:20:21,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786605025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:21,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:21,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:20:21,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596810363] [2024-11-13 13:20:21,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:21,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:20:21,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:21,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:20:21,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:21,879 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:23,211 INFO L93 Difference]: Finished difference Result 239 states and 278 transitions. [2024-11-13 13:20:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:20:23,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-13 13:20:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:23,213 INFO L225 Difference]: With dead ends: 239 [2024-11-13 13:20:23,214 INFO L226 Difference]: Without dead ends: 239 [2024-11-13 13:20:23,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:23,214 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 35 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:23,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 410 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 13:20:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-13 13:20:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 229. [2024-11-13 13:20:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 200 states have (on average 1.31) internal successors, (262), 227 states have internal predecessors, (262), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 267 transitions. [2024-11-13 13:20:23,220 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 267 transitions. Word has length 40 [2024-11-13 13:20:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:23,220 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 267 transitions. [2024-11-13 13:20:23,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 267 transitions. [2024-11-13 13:20:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:20:23,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:23,221 INFO L215 NwaCegarLoop]: trace histogram [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:20:23,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-13 13:20:23,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:23,422 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:23,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash -518467166, now seen corresponding path program 1 times [2024-11-13 13:20:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123643805] [2024-11-13 13:20:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:23,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:23,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:23,424 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:23,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 13:20:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:23,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 13:20:23,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:23,621 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:23,621 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 13 treesize of output 13 [2024-11-13 13:20:23,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:20:23,673 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:20:23,826 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:23,826 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 41 treesize of output 38 [2024-11-13 13:20:23,839 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:20:24,015 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:20:24,015 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:20:24,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:20:24,033 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:20:24,142 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:24,142 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 60 treesize of output 53 [2024-11-13 13:20:24,148 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:20:24,158 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 19 treesize of output 11 [2024-11-13 13:20:24,393 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 27 treesize of output 15 [2024-11-13 13:20:24,400 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:20:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:24,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:24,732 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 46 treesize of output 26 [2024-11-13 13:20:24,743 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-13 13:20:24,805 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem5#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem5#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-13 13:20:24,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-13 13:20:24,862 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814))) (= (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_815))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-13 13:20:24,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_814))) (= (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_815) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_815))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse2 .cse3 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse3)))))) is different from false [2024-11-13 13:20:24,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:24,930 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 51 treesize of output 44 [2024-11-13 13:20:24,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:24,942 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 35 treesize of output 36 [2024-11-13 13:20:24,947 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 64 treesize of output 56 [2024-11-13 13:20:24,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:24,977 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 394 treesize of output 337 [2024-11-13 13:20:25,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:25,022 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 64 treesize of output 63 [2024-11-13 13:20:25,032 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 78 treesize of output 72 [2024-11-13 13:20:25,042 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 50 treesize of output 46 [2024-11-13 13:20:25,149 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 13:20:25,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2024-11-13 13:20:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:25,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:25,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123643805] [2024-11-13 13:20:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123643805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:25,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:25,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2024-11-13 13:20:25,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414013371] [2024-11-13 13:20:25,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:25,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:20:25,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:25,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:20:25,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=339, Unknown=5, NotChecked=200, Total=600 [2024-11-13 13:20:25,318 INFO L87 Difference]: Start difference. First operand 229 states and 267 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:28,389 INFO L93 Difference]: Finished difference Result 292 states and 333 transitions. [2024-11-13 13:20:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:20:28,389 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-13 13:20:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:28,391 INFO L225 Difference]: With dead ends: 292 [2024-11-13 13:20:28,391 INFO L226 Difference]: Without dead ends: 292 [2024-11-13 13:20:28,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=167, Invalid=904, Unknown=5, NotChecked=330, Total=1406 [2024-11-13 13:20:28,392 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 365 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1305 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:28,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 920 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 870 Invalid, 0 Unknown, 1305 Unchecked, 2.2s Time] [2024-11-13 13:20:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-13 13:20:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 227. [2024-11-13 13:20:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 198 states have (on average 1.3080808080808082) internal successors, (259), 225 states have internal predecessors, (259), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 264 transitions. [2024-11-13 13:20:28,398 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 264 transitions. Word has length 40 [2024-11-13 13:20:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:28,398 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 264 transitions. [2024-11-13 13:20:28,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2024-11-13 13:20:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 13:20:28,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:28,399 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-13 13:20:28,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-13 13:20:28,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:28,601 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash 839203724, now seen corresponding path program 1 times [2024-11-13 13:20:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:28,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278304824] [2024-11-13 13:20:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:28,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:28,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:28,604 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:28,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 13:20:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:28,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 13:20:28,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:28,791 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 7 [2024-11-13 13:20:28,858 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:28,858 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 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 13:20:28,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:29,015 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:29,015 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 33 treesize of output 32 [2024-11-13 13:20:29,140 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:20:29,140 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 32 treesize of output 23 [2024-11-13 13:20:29,191 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:29,192 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 33 treesize of output 32 [2024-11-13 13:20:29,271 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 24 treesize of output 12 [2024-11-13 13:20:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:29,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:29,390 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-13 13:20:29,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-13 13:20:29,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_890))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_892)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-13 13:20:29,528 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_890))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_892)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-13 13:20:29,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:29,549 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 37 treesize of output 30 [2024-11-13 13:20:29,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:29,571 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 141 treesize of output 128 [2024-11-13 13:20:29,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:29,597 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 76 treesize of output 75 [2024-11-13 13:20:29,603 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 66 treesize of output 62 [2024-11-13 13:20:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:29,882 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:29,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278304824] [2024-11-13 13:20:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278304824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:29,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2024-11-13 13:20:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138474984] [2024-11-13 13:20:29,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:29,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:20:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:20:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=251, Unknown=8, NotChecked=140, Total=462 [2024-11-13 13:20:29,883 INFO L87 Difference]: Start difference. First operand 227 states and 264 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:32,339 INFO L93 Difference]: Finished difference Result 292 states and 332 transitions. [2024-11-13 13:20:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:20:32,339 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-13 13:20:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:32,340 INFO L225 Difference]: With dead ends: 292 [2024-11-13 13:20:32,340 INFO L226 Difference]: Without dead ends: 292 [2024-11-13 13:20:32,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=507, Unknown=9, NotChecked=204, Total=870 [2024-11-13 13:20:32,344 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 309 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1015 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:32,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 887 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 845 Invalid, 0 Unknown, 1015 Unchecked, 2.1s Time] [2024-11-13 13:20:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-13 13:20:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 227. [2024-11-13 13:20:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 198 states have (on average 1.303030303030303) internal successors, (258), 225 states have internal predecessors, (258), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 263 transitions. [2024-11-13 13:20:32,350 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 263 transitions. Word has length 42 [2024-11-13 13:20:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:32,351 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 263 transitions. [2024-11-13 13:20:32,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 263 transitions. [2024-11-13 13:20:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 13:20:32,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:32,351 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-13 13:20:32,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-13 13:20:32,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:32,552 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:32,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash -377250823, now seen corresponding path program 1 times [2024-11-13 13:20:32,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:32,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690754378] [2024-11-13 13:20:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:32,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:32,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:32,555 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:32,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-13 13:20:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:32,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 13:20:32,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:32,723 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 7 [2024-11-13 13:20:32,782 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:32,782 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 13 treesize of output 13 [2024-11-13 13:20:32,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:20:32,837 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:20:32,965 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:32,965 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 41 treesize of output 38 [2024-11-13 13:20:32,978 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:20:33,113 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:20:33,113 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:20:33,122 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:20:33,145 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:20:33,145 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:20:33,248 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:33,248 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 60 treesize of output 53 [2024-11-13 13:20:33,254 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:20:33,264 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 19 treesize of output 11 [2024-11-13 13:20:33,518 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 27 treesize of output 15 [2024-11-13 13:20:33,525 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:20:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:33,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:33,863 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 69 treesize of output 49 [2024-11-13 13:20:33,874 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_949 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-13 13:20:33,928 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_950 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem5#1.offset|)) (forall ((v_ArrVal_949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem5#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_949) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-13 13:20:34,096 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_944))) (= (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_945) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_950) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_945))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse1 .cse2 v_ArrVal_949) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse2))))) is different from false [2024-11-13 13:20:34,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_944))) (= (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_945) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_950) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_945))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_949) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-13 13:20:34,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:34,163 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 51 treesize of output 44 [2024-11-13 13:20:34,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:34,175 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 35 treesize of output 36 [2024-11-13 13:20:34,180 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 64 treesize of output 56 [2024-11-13 13:20:34,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:34,203 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 238 treesize of output 205 [2024-11-13 13:20:34,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:34,234 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 68 treesize of output 67 [2024-11-13 13:20:34,242 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 82 treesize of output 76 [2024-11-13 13:20:34,252 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 54 treesize of output 46 [2024-11-13 13:20:34,379 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 13:20:34,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2024-11-13 13:20:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:34,548 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:34,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690754378] [2024-11-13 13:20:34,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690754378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:34,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:34,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2024-11-13 13:20:34,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113558134] [2024-11-13 13:20:34,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:34,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:20:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:34,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:20:34,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=370, Unknown=8, NotChecked=164, Total=600 [2024-11-13 13:20:34,550 INFO L87 Difference]: Start difference. First operand 227 states and 263 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 25 states have internal predecessors, (78), 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 13:20:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:38,712 INFO L93 Difference]: Finished difference Result 299 states and 342 transitions. [2024-11-13 13:20:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:20:38,713 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 25 states have internal predecessors, (78), 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 44 [2024-11-13 13:20:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:38,715 INFO L225 Difference]: With dead ends: 299 [2024-11-13 13:20:38,715 INFO L226 Difference]: Without dead ends: 299 [2024-11-13 13:20:38,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=160, Invalid=969, Unknown=9, NotChecked=268, Total=1406 [2024-11-13 13:20:38,716 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 454 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1115 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:38,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1242 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1254 Invalid, 0 Unknown, 1115 Unchecked, 3.4s Time] [2024-11-13 13:20:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-13 13:20:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 235. [2024-11-13 13:20:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 233 states have internal predecessors, (268), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2024-11-13 13:20:38,723 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 44 [2024-11-13 13:20:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:38,723 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2024-11-13 13:20:38,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 25 states have internal predecessors, (78), 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 13:20:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2024-11-13 13:20:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 13:20:38,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:38,724 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-13 13:20:38,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-13 13:20:38,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:38,925 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:20:38,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1650396340, now seen corresponding path program 1 times [2024-11-13 13:20:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [89418937] [2024-11-13 13:20:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:38,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:38,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:38,928 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:38,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-13 13:20:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:39,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:20:39,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:39,215 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:39,215 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 13 treesize of output 13 [2024-11-13 13:20:39,252 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:20:39,336 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:39,337 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 25 treesize of output 26 [2024-11-13 13:20:39,445 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:20:39,445 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:20:39,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:20:39,457 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:20:39,610 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:39,610 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 56 treesize of output 51 [2024-11-13 13:20:39,616 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 45 treesize of output 28 [2024-11-13 13:20:40,040 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 31 treesize of output 19 [2024-11-13 13:20:40,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-13 13:20:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:40,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:42,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:42,825 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 118 treesize of output 141 [2024-11-13 13:20:46,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:46,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 601 treesize of output 520 [2024-11-13 13:20:46,781 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 502 treesize of output 494 [2024-11-13 13:20:46,791 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 494 treesize of output 486 [2024-11-13 13:20:46,803 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 486 treesize of output 482 [2024-11-13 13:20:46,817 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 482 treesize of output 474 [2024-11-13 13:20:46,831 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 474 treesize of output 464 [2024-11-13 13:20:47,354 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_999 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2024-11-13 13:20:47,368 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_999 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_999) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) is different from false [2024-11-13 13:20:47,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:47,389 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 19 treesize of output 20 [2024-11-13 13:20:47,393 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 33 treesize of output 25 [2024-11-13 13:20:47,400 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:20:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:50,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89418937] [2024-11-13 13:20:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89418937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:50,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:50,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2024-11-13 13:20:50,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649486044] [2024-11-13 13:20:50,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:50,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:20:50,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:50,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:20:50,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=431, Unknown=21, NotChecked=86, Total=600 [2024-11-13 13:20:50,276 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:21:01,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:21:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:20,279 INFO L93 Difference]: Finished difference Result 308 states and 353 transitions. [2024-11-13 13:21:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 13:21:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-13 13:21:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:20,281 INFO L225 Difference]: With dead ends: 308 [2024-11-13 13:21:20,281 INFO L226 Difference]: Without dead ends: 308 [2024-11-13 13:21:20,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=283, Invalid=1594, Unknown=23, NotChecked=170, Total=2070 [2024-11-13 13:21:20,282 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 483 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 549 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:20,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1130 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1364 Invalid, 1 Unknown, 549 Unchecked, 24.5s Time] [2024-11-13 13:21:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-13 13:21:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 237. [2024-11-13 13:21:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 235 states have internal predecessors, (270), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:21:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 275 transitions. [2024-11-13 13:21:20,287 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 275 transitions. Word has length 43 [2024-11-13 13:21:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:20,288 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 275 transitions. [2024-11-13 13:21:20,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:21:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 275 transitions. [2024-11-13 13:21:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 13:21:20,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:20,288 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:20,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-13 13:21:20,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:20,489 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:21:20,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash 101109785, now seen corresponding path program 1 times [2024-11-13 13:21:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:21:20,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836593556] [2024-11-13 13:21:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:20,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:20,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:20,493 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:20,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-13 13:21:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:20,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 13:21:20,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:20,903 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-13 13:21:20,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-13 13:21:20,968 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 21 [2024-11-13 13:21:21,000 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 21 [2024-11-13 13:21:21,040 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 21 [2024-11-13 13:21:21,070 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 19 treesize of output 11 [2024-11-13 13:21:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:21:21,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:21,540 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 48 treesize of output 40 [2024-11-13 13:21:21,546 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 16 treesize of output 14 [2024-11-13 13:21:21,993 INFO L349 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2024-11-13 13:21:21,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 54 [2024-11-13 13:21:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:21:22,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:21:22,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836593556] [2024-11-13 13:21:22,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836593556] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:21:22,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:21:22,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-11-13 13:21:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428866676] [2024-11-13 13:21:22,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:21:22,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:21:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:21:22,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:21:22,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=177, Unknown=14, NotChecked=0, Total=240 [2024-11-13 13:21:22,009 INFO L87 Difference]: Start difference. First operand 237 states and 275 transitions. Second operand has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:21:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:24,569 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2024-11-13 13:21:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:21:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-13 13:21:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:24,571 INFO L225 Difference]: With dead ends: 277 [2024-11-13 13:21:24,571 INFO L226 Difference]: Without dead ends: 277 [2024-11-13 13:21:24,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=456, Unknown=14, NotChecked=0, Total=650 [2024-11-13 13:21:24,571 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 649 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:24,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 559 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 13:21:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-13 13:21:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 249. [2024-11-13 13:21:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 221 states have (on average 1.2850678733031675) internal successors, (284), 247 states have internal predecessors, (284), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:21:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 289 transitions. [2024-11-13 13:21:24,580 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 289 transitions. Word has length 45 [2024-11-13 13:21:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:24,581 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 289 transitions. [2024-11-13 13:21:24,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:21:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 289 transitions. [2024-11-13 13:21:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 13:21:24,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:24,581 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:24,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-13 13:21:24,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:24,782 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-13 13:21:24,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash 101109786, now seen corresponding path program 1 times [2024-11-13 13:21:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:21:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125908466] [2024-11-13 13:21:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:24,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:24,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:24,785 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:24,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b0beea-17e7-44f7-a3da-a78328da157e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-13 13:21:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:24,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 13:21:24,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:24,968 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 7 [2024-11-13 13:21:25,045 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 13:21:25,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 13:21:25,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:21:25,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:21:25,141 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:21:25,356 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:21:25,357 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 54 [2024-11-13 13:21:25,365 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:21:25,571 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:21:25,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 33 [2024-11-13 13:21:25,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:25,599 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:21:25,712 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:21:25,712 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 54 [2024-11-13 13:21:25,725 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:21:26,173 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 13:21:26,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-13 13:21:26,216 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-13 13:21:26,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-13 13:21:26,291 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:21:26,302 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 25 [2024-11-13 13:21:26,333 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 25 [2024-11-13 13:21:26,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:21:26,376 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 25 [2024-11-13 13:21:26,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:21:26,457 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 25 treesize of output 13 [2024-11-13 13:21:26,465 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:21:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:21:26,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:26,658 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1158) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2024-11-13 13:21:26,753 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1159) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1153 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1159) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv8 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1158) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))))))) is different from false [2024-11-13 13:21:28,208 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1151) |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1153 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1151) |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1152) |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1158) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) is different from false [2024-11-13 13:21:28,363 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1153 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1151) |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1152) |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1158) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1151) |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))))) is different from false [2024-11-13 13:21:28,487 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_ArrVal_1147 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1147) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1148) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1151) |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_ArrVal_1147 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1148))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1147) .cse1 v_ArrVal_1151) |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) (select (select (store (store .cse2 .cse1 v_ArrVal_1152) |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1158) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) is different from false [2024-11-13 13:21:29,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:29,860 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 79 treesize of output 72 [2024-11-13 13:21:29,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:29,879 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 63 treesize of output 56 [2024-11-13 13:21:29,889 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 96 treesize of output 84 [2024-11-13 13:21:29,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:29,951 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 838 treesize of output 805 [2024-11-13 13:21:29,973 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 174 treesize of output 158 [2024-11-13 13:21:29,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 222 [2024-11-13 13:21:30,012 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 150 treesize of output 146 [2024-11-13 13:21:30,024 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 218 treesize of output 194 [2024-11-13 13:21:30,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:30,757 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 82 treesize of output 83 [2024-11-13 13:21:30,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:30,788 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 74 treesize of output 59 [2024-11-13 13:21:30,797 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:21:30,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:30,873 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 728 treesize of output 663 [2024-11-13 13:21:30,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:21:30,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:30,983 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 2071 treesize of output 1982 [2024-11-13 13:21:31,063 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 619 treesize of output 595 [2024-11-13 13:21:31,084 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 595 treesize of output 571 [2024-11-13 13:21:31,099 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 571 treesize of output 563 [2024-11-13 13:21:31,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:31,165 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 563 treesize of output 519 [2024-11-13 13:24:09,666 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)))) (let ((.cse252 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse86 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse18 (select |c_#length| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (let ((.cse318 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse925 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse925 .cse18) (bvule .cse925 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184)))))) (.cse0 (not .cse86)) (.cse776 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse924 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse923 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse922 (select .cse924 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse922) (bvule .cse923 (select .cse924 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse923 .cse922)))))) (.cse131 (not .cse252)) (.cse140 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_#t~malloc3#1.offset|)) (.cse139 (select |c_#length| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse348 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse921 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse919 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse920 (select .cse921 v_arrayElimCell_184))) (or (bvule .cse919 .cse920) (bvule .cse919 (select .cse921 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse920)))))) (.cse649 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse918 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse916 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse917 (select .cse918 v_arrayElimCell_184))) (or (bvule .cse916 .cse917) (bvule .cse916 (select .cse918 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse917)))))) (.cse34 (forall ((v_arrayElimCell_182 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse18))) (.cse154 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse915 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse912 (select .cse915 v_arrayElimCell_187)) (.cse911 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse911 .cse912) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse914 (select .cse915 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse913 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse913 .cse914) (bvule .cse913 .cse912)))) (bvule .cse911 .cse914))))))))))) (.cse156 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse910 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse909 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse908 (select .cse910 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse908) (bvule .cse909 (select .cse910 v_arrayElimCell_187)) (bvule .cse909 .cse908))))))))) (let ((.cse417 (and .cse154 .cse156)) (.cse284 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse906 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse905 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse907 (select .cse906 v_arrayElimCell_187))) (or (bvule .cse905 (select .cse906 v_arrayElimCell_184)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse907) (bvule .cse905 .cse907) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187)))))) (.cse319 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse904 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse904 .cse18) (bvule .cse904 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184)))))))) (.cse104 (or .cse649 .cse34)) (.cse323 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse902 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse903 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse902 (select .cse903 v_arrayElimCell_184)) (bvule .cse902 (select .cse903 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))) (.cse264 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))))) (.cse293 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_187 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (forall ((v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse901 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse898 (select .cse901 v_arrayElimCell_187)) (.cse897 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse897 .cse898) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse900 (select .cse901 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse899 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse899 .cse900) (bvule .cse899 .cse898)))) (bvule .cse897 .cse900)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse416 (or .cse252 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse896 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse896 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) (select .cse896 v_arrayElimCell_184))))))) (.cse239 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse894 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse895 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse894 (select .cse895 v_arrayElimCell_184)) (bvule .cse894 (select .cse895 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))))) (.cse103 (or .cse348 .cse34)) (.cse482 (or .cse252 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse893 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse893 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) (select .cse893 v_arrayElimCell_184))))))) (.cse123 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse892 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) (select .cse892 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse892 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse124 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse891 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) (select .cse891 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse891 v_arrayElimCell_180))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse384 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse889 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse890 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse887 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse888 (select .cse890 v_arrayElimCell_184))) (or (bvule .cse887 .cse139) (bvule .cse887 .cse888) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse888) (bvule .cse889 .cse888)))) (bvule .cse889 .cse139) (bvule .cse889 (select .cse890 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse516 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse886 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse885 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse884 (select .cse886 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse884) (bvule .cse885 (select .cse886 v_arrayElimCell_180)) (bvule .cse885 .cse884))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse418 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32))) (let ((.cse883 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse882 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse881 (select .cse883 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse881) (bvule .cse882 (select .cse883 v_arrayElimCell_188)) (bvule .cse882 .cse881))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse42 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse880 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse878 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse879 (select .cse880 v_arrayElimCell_184))) (or (bvule .cse878 .cse879) (bvule .cse878 (select .cse880 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse880 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse879))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse43 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse877 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse875 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse876 (select .cse877 v_arrayElimCell_184))) (or (bvule .cse875 .cse876) (bvule .cse875 (select .cse877 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse877 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse876))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse78 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse874 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse871 (select .cse874 v_arrayElimCell_187)) (.cse870 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse870 .cse871) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse873 (select .cse874 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse872 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse872 .cse873) (bvule .cse872 .cse871)))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse873) (bvule .cse870 .cse873)))) (bvule .cse870 (select .cse874 v_arrayElimCell_180)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse79 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse868 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse869 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse866 (select .cse869 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse866) (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse867 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse867 .cse139) (bvule .cse867 .cse866)))) (bvule .cse868 .cse866)))) (bvule .cse868 .cse139) (bvule .cse868 (select .cse869 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse80 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse865 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse864 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse863 (select .cse865 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse863) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse863) (bvule .cse864 .cse139) (bvule .cse864 (select .cse865 v_arrayElimCell_180)) (bvule .cse864 .cse863))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse81 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse862 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse861 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse860 (select .cse862 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse860) (bvule .cse861 (select .cse862 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse860) (bvule .cse861 (select .cse862 v_arrayElimCell_180)) (bvule .cse861 .cse860)))))))) (.cse82 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse858 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse856 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse859 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse857 (select .cse858 v_arrayElimCell_184))) (or (bvule .cse856 .cse857) (bvule .cse856 (select .cse858 v_arrayElimCell_187)) (bvule .cse859 .cse857) (bvule .cse859 (select .cse858 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse857)))))))))) (.cse83 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse855 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse851 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse852 (select .cse855 v_arrayElimCell_180))) (or (bvule .cse851 .cse852) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse853 (select .cse855 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse853) (bvule .cse851 .cse853) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse854 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse854 .cse139) (bvule .cse854 .cse852) (bvule .cse854 .cse853))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse84 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse849 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse847 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse850 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse848 (select .cse849 v_arrayElimCell_184))) (or (bvule .cse847 .cse848) (bvule .cse847 (select .cse849 v_arrayElimCell_187)) (bvule .cse850 .cse848) (bvule .cse850 (select .cse849 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse848))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse339 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse846 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse844 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse845 (select .cse846 v_arrayElimCell_184))) (or (bvule .cse844 .cse845) (bvule .cse844 (select .cse846 v_arrayElimCell_187)) (bvule .cse140 .cse845) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse845)))))) (.cse338 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse843 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse841 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse842 (select .cse843 v_arrayElimCell_184))) (or (bvule .cse841 .cse842) (bvule .cse841 (select .cse843 v_arrayElimCell_187)) (bvule .cse140 .cse842) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse842)))))) (.cse153 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse840 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse839 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse838 (select .cse840 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse838) (bvule .cse839 (select .cse840 v_arrayElimCell_187)) (bvule .cse140 .cse838) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse839 .cse838)))))) (.cse135 (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse627 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse837 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse835 (select .cse837 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse835) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse836 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse836 (select .cse837 v_arrayElimCell_187)) (bvule .cse836 (select .cse837 v_arrayElimCell_180)) (bvule .cse836 .cse835)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse111 (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse834 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse833 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse833) (bvule .cse834 .cse139) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse834 .cse833)))) .cse131)) (.cse517 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse832 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse830 (select .cse832 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse830) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse831 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse831 .cse139) (bvule .cse831 (select .cse832 v_arrayElimCell_180)) (bvule .cse831 .cse830))))))))))) (.cse607 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse828 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse829 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse828 (select .cse829 v_arrayElimCell_187)) (bvule .cse828 (select .cse829 v_arrayElimCell_180)) (bvule .cse828 (select .cse829 v_arrayElimCell_184))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse150 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse826 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse826) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse827 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse827 .cse139) (bvule .cse827 .cse826)))) (bvule .cse140 .cse826)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse152 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse825 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse821 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse824 (select .cse825 v_arrayElimCell_187)) (.cse823 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse822 (select .cse825 v_arrayElimCell_184))) (or (bvule .cse821 .cse822) (bvule .cse823 .cse824) (bvule .cse821 .cse824) (bvule .cse140 .cse822) (bvule .cse823 .cse822))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse108 (or .cse131 .cse776)) (.cse157 (or .cse0 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32))) (let ((.cse820 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse818 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse819 (select .cse820 v_arrayElimCell_184))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_188) (bvule .cse818 .cse819) (bvule .cse818 (select .cse820 v_arrayElimCell_188)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse819))))))) (.cse155 (or .cse0 .cse348)) (.cse158 (or .cse86 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32))) (let ((.cse817 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse816 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse815 (select .cse817 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse815) (bvule .cse816 (select .cse817 v_arrayElimCell_188)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse816 .cse815))))))) (.cse159 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32))) (let ((.cse814 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse813 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse812 (select .cse814 v_arrayElimCell_188))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse811 (select .cse814 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse810 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse810 .cse811) (bvule .cse810 .cse812)))) (bvule .cse813 .cse811)))) (bvule .cse813 .cse812))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse160 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse809 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse808 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse808) (bvule .cse809 .cse139) (bvule .cse809 .cse808))))))) (.cse668 (or .cse252 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse806 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse807 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse806 (select .cse807 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse806 (select .cse807 v_arrayElimCell_184))))))) (.cse619 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse804 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse805 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse804 .cse139) (bvule .cse804 (select .cse805 v_arrayElimCell_180)) (bvule .cse804 (select .cse805 v_arrayElimCell_184))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse529 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse802 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse803 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse802 (select .cse803 v_arrayElimCell_180)) (bvule .cse802 (select .cse803 v_arrayElimCell_184))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse35 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse146 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187)))) (.cse248 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse800 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse799 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse801 (select .cse800 v_arrayElimCell_187))) (or (bvule .cse799 (select .cse800 v_arrayElimCell_184)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse801) (bvule .cse799 .cse801) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))))) (.cse735 (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse798 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse798 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) (select .cse798 v_arrayElimCell_184))))) .cse252)) (.cse1 (or .cse252 .cse318)) (.cse342 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse796 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse797 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse796 (select .cse797 v_arrayElimCell_187)) (bvule .cse796 .cse18) (bvule .cse796 (select .cse797 v_arrayElimCell_184)))))))) (.cse145 (bvule .cse140 .cse18))) (let ((.cse109 (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse795 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse794 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse794) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse795 .cse18) (bvule .cse795 .cse794)))) .cse252)) (.cse110 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse793 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse791 (select .cse793 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse791) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse792 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse792 (select .cse793 v_arrayElimCell_187)) (bvule .cse792 .cse18) (bvule .cse792 .cse791)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse238 (or .cse145 .cse348)) (.cse177 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse790 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse786 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse789 (select .cse790 v_arrayElimCell_187)) (.cse788 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse787 (select .cse790 v_arrayElimCell_184))) (or (bvule .cse786 .cse787) (bvule .cse788 .cse789) (bvule .cse786 .cse789) (bvule .cse140 .cse787) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse790 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule .cse788 .cse787)))))) (.cse147 (or .cse252 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse785 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse785 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) (select .cse785 v_arrayElimCell_184))))))) (.cse48 (or .cse0 (and .cse1 .cse342))) (.cse179 (or .cse86 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse784 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse783 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse783 .cse139) (bvule .cse783 (select .cse784 v_arrayElimCell_184))))) (bvule .cse140 (select .cse784 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) .cse735))) (.cse207 (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse781 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse780 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse782 (select .cse781 v_arrayElimCell_187))) (or (bvule .cse780 (select .cse781 v_arrayElimCell_184)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse782) (bvule .cse780 .cse782) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse781 v_arrayElimCell_180)))))))) (.cse40 (or .cse348 .cse131)) (.cse41 (or .cse649 .cse131)) (.cse216 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse779 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse777 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse778 (select .cse779 v_arrayElimCell_184))) (or (bvule .cse777 .cse778) (bvule .cse777 (select .cse779 v_arrayElimCell_187)) (bvule .cse140 (select .cse779 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse778))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse37 (or (and (or .cse0 .cse248) .cse154 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse773 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse772 (select .cse773 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse771 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse771 .cse772) (bvule .cse771 (select .cse773 v_arrayElimCell_187))))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse772))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse774 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse775 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse774 (select .cse775 v_arrayElimCell_184)) (bvule .cse774 (select .cse775 v_arrayElimCell_187))))))))) (or .cse86 .cse776)) .cse131)) (.cse195 (or .cse252 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse770 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse769 (select .cse770 v_arrayElimCell_180)) (.cse768 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse768 .cse769) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 .cse769) (bvule .cse768 (select .cse770 v_arrayElimCell_184)))))))) (.cse196 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse767 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse764 (select .cse767 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse765 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse763 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse763 .cse764) (forall ((v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse766 (select .cse767 v_arrayElimCell_187))) (or (bvule .cse765 .cse766) (bvule .cse763 .cse766) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))))) (bvule .cse765 .cse764)))) (bvule .cse140 .cse764)))) (bvule .cse140 (select .cse767 v_arrayElimCell_180)))))))) (.cse205 (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse762 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse761 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse760 (select .cse762 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse760) (bvule .cse761 (select .cse762 v_arrayElimCell_187)) (bvule .cse140 .cse760) (bvule .cse761 (select .cse762 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse761 .cse760))))))) (.cse197 (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse759 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse758 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse757 (select .cse759 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse757) (bvule .cse758 .cse139) (bvule .cse140 .cse757) (bvule .cse758 (select .cse759 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse758 .cse757))))))) (.cse31 (or .cse131 .cse146)) (.cse32 (or .cse131 .cse35)) (.cse181 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse756 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) (select .cse756 v_arrayElimCell_187)) (bvule .cse140 (select .cse756 v_arrayElimCell_180))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse198 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse751 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse140 (select .cse751 v_arrayElimCell_180)) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse752 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse752 (select .cse751 v_arrayElimCell_184)) (bvule .cse752 (select .cse751 v_arrayElimCell_187)))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse755 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse754 (select .cse755 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse753 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse753 .cse754) (bvule .cse753 (select .cse755 v_arrayElimCell_187))))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse754)))) (bvule .cse140 (select .cse755 v_arrayElimCell_180))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))))) (.cse199 (or .cse252 (and (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse744 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse743 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse742 (select .cse744 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse742) (bvule .cse140 .cse742) (bvule .cse743 (select .cse744 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse743 .cse742)))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse746 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse745 (select .cse746 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse745) (bvule .cse140 .cse745) (bvule .cse140 (select .cse746 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse745))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse750 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse749 (select .cse750 v_arrayElimCell_180))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse747 (select .cse750 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse747) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse748 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse748 .cse749) (bvule .cse748 .cse747)))) (bvule .cse140 .cse747)))) (bvule .cse140 .cse749)))))))))) (.cse200 (or .cse252 (and (or .cse0 (and .cse529 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse738 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse737 (select .cse738 v_arrayElimCell_180)) (.cse736 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse736 .cse737) (bvule .cse140 .cse737) (bvule .cse736 (select .cse738 v_arrayElimCell_184)))))))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (bvule .cse140 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_180))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse741 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse740 (select .cse741 v_arrayElimCell_180))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse739 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse739 .cse740) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (bvule .cse739 (select .cse741 v_arrayElimCell_184)))))) (bvule .cse140 .cse740)))))))))) (.cse219 (or .cse86 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse734 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse733 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse733 (select .cse734 v_arrayElimCell_187)) (bvule .cse733 (select .cse734 v_arrayElimCell_184))))) (bvule .cse140 (select .cse734 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) .cse735))) (.cse60 (or .cse0 (and .cse668 .cse619))) (.cse62 (or (and .cse154 .cse157 .cse155 .cse158 .cse159 .cse156 .cse160) .cse131)) (.cse201 (or .cse86 (and .cse108 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse732 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse731 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse730 (select .cse732 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse730) (bvule .cse731 (select .cse732 v_arrayElimCell_187)) (bvule .cse140 (select .cse732 v_arrayElimCell_180)) (bvule .cse731 .cse730)))))))))) (.cse202 (or .cse131 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse729 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse728 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse727 (select .cse729 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse727) (bvule .cse728 (select .cse729 v_arrayElimCell_187)) (bvule .cse140 .cse727) (bvule .cse728 .cse727))))))) .cse150 .cse152))) (.cse182 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse726 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse725 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse724 (select .cse726 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse724) (bvule .cse725 .cse139) (bvule .cse140 .cse724) (bvule .cse725 (select .cse726 v_arrayElimCell_180)) (bvule .cse725 .cse724)))))))) (.cse183 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse723 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse722 (select .cse723 v_arrayElimCell_180))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse720 (select .cse723 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse720) (bvule .cse140 .cse720) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse721 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse721 .cse139) (bvule .cse721 .cse722) (bvule .cse721 .cse720))))))) (bvule .cse140 .cse722)))))))) (.cse192 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse719 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse716 (select .cse719 v_arrayElimCell_187)) (.cse715 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse715 .cse716) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse718 (select .cse719 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse717 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse717 .cse718) (bvule .cse717 .cse716)))) (bvule .cse140 .cse718) (bvule .cse715 .cse718)))) (bvule .cse715 (select .cse719 v_arrayElimCell_180)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse191 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse714 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse712 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse713 (select .cse714 v_arrayElimCell_184))) (or (bvule .cse712 .cse713) (bvule .cse712 (select .cse714 v_arrayElimCell_187)) (bvule .cse140 .cse713) (bvule .cse140 (select .cse714 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse713))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse193 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse711 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse710 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse709 (select .cse711 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse709) (bvule .cse710 (select .cse711 v_arrayElimCell_187)) (bvule .cse140 .cse709) (bvule .cse710 (select .cse711 v_arrayElimCell_180)) (bvule .cse710 .cse709))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse194 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse705 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse706 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse705 .cse139) (bvule .cse705 (select .cse706 v_arrayElimCell_180)) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse707 (select .cse706 v_arrayElimCell_184))) (or (bvule .cse140 .cse707) (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse708 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse708 .cse139) (bvule .cse708 .cse707)))) (bvule .cse705 .cse707))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse208 (or (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse700 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse140 (select .cse700 v_arrayElimCell_180)) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse701 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse701 (select .cse700 v_arrayElimCell_184)) (bvule .cse701 (select .cse700 v_arrayElimCell_187)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse704 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse703 (select .cse704 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse702 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse702 .cse703) (bvule .cse702 (select .cse704 v_arrayElimCell_187))))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse703)))) (bvule .cse140 (select .cse704 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) .cse0)) (.cse229 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse698 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse699 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse696 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse697 (select .cse699 v_arrayElimCell_184))) (or (bvule .cse696 .cse139) (bvule .cse696 .cse697) (bvule .cse140 .cse697) (bvule .cse698 .cse697)))) (bvule .cse698 .cse139) (bvule .cse698 (select .cse699 v_arrayElimCell_180)))))))) (.cse206 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse694 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse695 (select .cse694 v_arrayElimCell_180)) (.cse693 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse692 (select .cse694 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse692) (bvule .cse693 (select .cse694 v_arrayElimCell_187)) (bvule .cse140 .cse692) (bvule .cse693 .cse695) (bvule .cse140 .cse695) (bvule .cse693 .cse692))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse204 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse691 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse688 (select .cse691 v_arrayElimCell_187)) (.cse687 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse687 .cse688) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse690 (select .cse691 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse689 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse689 .cse690) (bvule .cse689 .cse688)))) (bvule .cse687 .cse690))))))) (bvule .cse140 (select .cse691 v_arrayElimCell_180)))))))))) (.cse209 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse686 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse683 (select .cse686 v_arrayElimCell_187)) (.cse682 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse682 .cse683) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse685 (select .cse686 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse684 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse684 .cse685) (bvule .cse684 .cse683)))) (bvule .cse682 .cse685))))))) (bvule .cse140 (select .cse686 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse212 (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse680 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse679 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse681 (select .cse680 v_arrayElimCell_187))) (or (bvule .cse679 (select .cse680 v_arrayElimCell_184)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse681) (bvule .cse679 .cse681) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse680 v_arrayElimCell_180)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))))) (.cse221 (or .cse86 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse678 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse677 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse676 (select .cse678 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse676) (bvule .cse677 (select .cse678 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse678 v_arrayElimCell_180)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (bvule .cse677 .cse676))))))) (.cse222 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse675 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse674 (select .cse675 v_arrayElimCell_180))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse673 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse673 .cse139) (bvule .cse673 .cse674) (bvule .cse673 (select .cse675 v_arrayElimCell_184))))) (bvule .cse140 .cse674))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse223 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse672 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse671 (select .cse672 v_arrayElimCell_180)) (.cse670 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse669 (select .cse672 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse669) (bvule .cse670 .cse139) (bvule .cse140 .cse669) (bvule .cse670 .cse671) (bvule .cse140 .cse671) (bvule .cse670 .cse669)))))))) (.cse101 (or .cse0 (and .cse607 .cse668))) (.cse106 (or .cse0 (and (or .cse252 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse667 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse666 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse665 (select .cse667 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse665) (bvule .cse666 (select .cse667 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse666 .cse665)))))) .cse108 .cse627 .cse111 .cse517))) (.cse220 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse664 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse662 (select .cse664 v_arrayElimCell_180))) (or (bvule .cse140 .cse662) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse663 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse663 (select .cse664 v_arrayElimCell_187)) (bvule .cse663 .cse662) (bvule .cse663 (select .cse664 v_arrayElimCell_184))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse230 (or .cse86 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse661 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse660 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse659 (select .cse661 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse659) (bvule .cse660 (select .cse661 v_arrayElimCell_187)) (bvule .cse140 .cse659) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse661 v_arrayElimCell_180)) (bvule .cse660 .cse659))))))) (.cse232 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse658 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse653 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse656 (select .cse658 v_arrayElimCell_187)) (.cse657 (select .cse658 v_arrayElimCell_180)) (.cse655 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse654 (select .cse658 v_arrayElimCell_184))) (or (bvule .cse653 .cse654) (bvule .cse655 .cse656) (bvule .cse653 .cse656) (bvule .cse140 .cse654) (bvule .cse655 .cse657) (bvule .cse140 .cse657) (bvule .cse655 .cse654)))))))) (.cse210 (or .cse86 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse652 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse651 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse650 (select .cse652 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse650) (bvule .cse651 (select .cse652 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse652 v_arrayElimCell_180)) (bvule .cse651 .cse650))))))) (.cse249 (or .cse145 .cse649)) (.cse151 (or .cse153 .cse135)) (.cse301 (or .cse338 .cse131)) (.cse302 (or .cse339 .cse131)) (.cse66 (or .cse0 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse648 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse647 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse646 (select .cse648 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse646) (bvule .cse647 (select .cse648 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse646) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse647 .cse18) (bvule .cse647 .cse646))))))) (.cse116 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse643 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse645 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse644 (select .cse643 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse642 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse641 (select .cse643 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse641) (bvule .cse642 (select .cse643 v_arrayElimCell_187)) (bvule .cse642 .cse644) (bvule .cse645 .cse641) (bvule .cse645 .cse644) (bvule .cse642 .cse641))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse38 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse640 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse634 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse637 (select .cse640 v_arrayElimCell_187)) (.cse638 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse639 (select .cse640 v_arrayElimCell_180)) (.cse636 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse635 (select .cse640 v_arrayElimCell_184))) (or (bvule .cse634 .cse635) (bvule .cse636 .cse637) (bvule .cse634 .cse637) (bvule .cse638 .cse635) (bvule .cse638 .cse639) (bvule .cse636 .cse639) (bvule .cse636 .cse635))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse4 (or .cse0 (and .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse84))) (.cse5 (or .cse0 (and .cse42 .cse43))) (.cse56 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse633 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse628 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse631 (select .cse633 v_arrayElimCell_187)) (.cse632 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse630 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse629 (select .cse633 v_arrayElimCell_184))) (or (bvule .cse628 .cse629) (bvule .cse630 .cse631) (bvule .cse628 .cse631) (bvule .cse632 .cse629) (bvule .cse632 (select .cse633 v_arrayElimCell_180)) (bvule .cse630 .cse629))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse8 (or .cse131 (and .cse154 .cse159 .cse156 .cse418 .cse160))) (.cse9 (or .cse0 (and .cse627 .cse516 .cse517))) (.cse93 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse626 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse622 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse625 (select .cse626 v_arrayElimCell_187)) (.cse624 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse623 (select .cse626 v_arrayElimCell_184))) (or (bvule .cse622 .cse623) (bvule .cse624 .cse625) (bvule .cse622 .cse625) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse623) (bvule .cse624 (select .cse626 v_arrayElimCell_180)) (bvule .cse624 .cse623))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) .cse384))) (.cse97 (or .cse86 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse620 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse621 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse620 (select .cse621 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse621 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse620 (select .cse621 v_arrayElimCell_184))))))) (.cse11 (or .cse0 (and .cse123 .cse124))) (.cse3 (or .cse0 (and .cse529 .cse619))) (.cse46 (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse618 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse617 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse616 (select .cse618 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse616) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse616) (bvule .cse617 .cse139) (bvule .cse617 (select .cse618 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse617 .cse616))))))) (.cse47 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse615 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse613 (select .cse615 v_arrayElimCell_180))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse613) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse614 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse614 .cse139) (bvule .cse614 .cse613) (bvule .cse614 (select .cse615 v_arrayElimCell_184))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse44 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse612 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse610 (select .cse612 v_arrayElimCell_180))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse610) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse611 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse611 (select .cse612 v_arrayElimCell_187)) (bvule .cse611 .cse610) (bvule .cse611 (select .cse612 v_arrayElimCell_184))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse67 (or .cse86 (and .cse482 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse608 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse608 v_arrayElimCell_180)) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse609 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse609 (select .cse608 v_arrayElimCell_187)) (bvule .cse609 (select .cse608 v_arrayElimCell_184)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))))) (.cse12 (or .cse0 (and .cse607 .cse529))) (.cse49 (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse605 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse604 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse606 (select .cse605 v_arrayElimCell_187))) (or (bvule .cse604 (select .cse605 v_arrayElimCell_184)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse606) (bvule .cse604 .cse606) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse605 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))))) (.cse36 (or .cse86 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse603 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse602 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse601 (select .cse603 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse601) (bvule .cse602 (select .cse603 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse603 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse602 .cse601))))))) (.cse70 (or .cse0 (and (or .cse34 .cse239) .cse103))) (.cse75 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse600 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse597 (select .cse600 v_arrayElimCell_187)) (.cse596 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse596 .cse597) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse599 (select .cse600 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse598 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse598 .cse599) (bvule .cse598 .cse597)))) (bvule .cse596 .cse599))))))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse600 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse94 (or .cse0 .cse248 .cse34)) (.cse45 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse594 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse595 (select .cse594 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse593 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse593 (select .cse594 v_arrayElimCell_187)) (bvule .cse593 .cse595) (bvule .cse593 (select .cse594 v_arrayElimCell_184))))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse595))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse59 (or (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse591 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse591 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse592 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse592 (select .cse591 v_arrayElimCell_187)) (bvule .cse592 (select .cse591 v_arrayElimCell_184)))))))))) .cse416) .cse86)) (.cse55 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse590 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse588 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse589 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule .cse588 .cse139) (bvule .cse588 .cse589) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse589) (bvule .cse590 .cse589)))) (bvule .cse590 .cse139) (bvule .cse590 .cse18)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse112 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse586 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse586) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse587 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse587 .cse139) (bvule .cse587 .cse18) (bvule .cse587 .cse586))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse57 (or .cse86 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse584 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse585 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse583 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse582 (select .cse584 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse582) (bvule .cse583 (select .cse584 v_arrayElimCell_187)) (bvule .cse585 .cse582) (bvule .cse585 (select .cse584 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse583 .cse582))))))) (.cse6 (or (and .cse293 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse581 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse580 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse579 (select .cse581 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse579) (bvule .cse580 (select .cse581 v_arrayElimCell_187)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (bvule .cse580 .cse579)))))))) .cse131)) (.cse58 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse578 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse577 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse574 (select .cse577 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse575 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse573 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse573 .cse574) (forall ((v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse576 (select .cse577 v_arrayElimCell_187))) (or (bvule .cse575 .cse576) (bvule .cse573 .cse576) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))))) (bvule .cse575 .cse574)))) (bvule .cse578 .cse574)))) (bvule .cse578 (select .cse577 |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))))) (.cse61 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse572 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse571 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse570 (select .cse572 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse569 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse568 (select .cse572 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse568) (bvule .cse569 .cse570) (bvule .cse571 .cse568) (bvule .cse571 .cse570) (bvule .cse569 .cse139) (bvule .cse569 .cse568)))))))) (.cse63 (or .cse86 (and .cse108 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse567 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse566 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse565 (select .cse567 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse565) (bvule .cse566 (select .cse567 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse567 v_arrayElimCell_180)) (bvule .cse566 .cse565)))))))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse564 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse564 .cse139) (bvule .cse564 .cse18) (bvule .cse564 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse7 (or .cse264 .cse131)) (.cse65 (or .cse0 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse563 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse562 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse562) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse562) (bvule .cse563 .cse139) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse563 .cse18) (bvule .cse563 .cse562)))))) (.cse69 (or .cse252 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse554 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse553 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse552 (select .cse554 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse552) (bvule .cse553 .cse552) (bvule .cse553 (select .cse554 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse552))))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse556 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse555 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse555) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse555) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse556 .cse18) (bvule .cse556 .cse555))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse561 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse558 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse560 (select .cse561 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse557 (select .cse561 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse557) (bvule .cse558 .cse557) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse559 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse559 .cse560) (bvule .cse559 .cse557))))))) (bvule .cse558 .cse560)))))))))) (.cse71 (or .cse252 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse545 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse542 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse544 (select .cse545 v_arrayElimCell_180))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse541 (select .cse545 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse541) (bvule .cse542 .cse541) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse543 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse543 .cse544) (bvule .cse543 .cse541))))))) (bvule .cse542 .cse544))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse548 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse547 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse546 (select .cse548 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse546) (bvule .cse547 .cse546) (bvule .cse547 (select .cse548 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse546))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse551 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse550 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse549 (select .cse551 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse549) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse549) (bvule .cse550 (select .cse551 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse550 .cse549))))))))) (.cse33 (or .cse34 .cse146)) (.cse72 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse538 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse537 (select .cse538 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse536 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse536 .cse537) (bvule .cse536 (select .cse538 v_arrayElimCell_187))))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse537)))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse538 v_arrayElimCell_180))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse539 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse539 v_arrayElimCell_180)) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse540 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse540 (select .cse539 v_arrayElimCell_184)) (bvule .cse540 (select .cse539 v_arrayElimCell_187)))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187)))))))) (.cse74 (or .cse86 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse535 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse534 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse533 (select .cse535 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse533) (bvule .cse534 (select .cse535 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse535 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (bvule .cse534 .cse533))))))) (.cse76 (or (and (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse528 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse526 (select .cse528 v_arrayElimCell_180)) (.cse527 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse526) (bvule .cse527 .cse526) (bvule .cse527 (select .cse528 v_arrayElimCell_184)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) .cse529)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse532 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse531 (select .cse532 v_arrayElimCell_180))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse530 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse530 .cse531) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (bvule .cse530 (select .cse532 v_arrayElimCell_184)))))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse531))))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_180))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) .cse252)) (.cse77 (or .cse252 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse525 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse524 (select .cse525 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse523 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse523 .cse524) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse524) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse523 (select .cse525 v_arrayElimCell_184)))))))) (.cse39 (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse521 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse522 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse521 (select .cse522 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse521 (select .cse522 v_arrayElimCell_184))))) .cse131)) (.cse89 (or .cse86 (and .cse108 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse520 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse519 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse518 (select .cse520 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse518) (bvule .cse519 (select .cse520 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse520 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule .cse519 .cse518))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))))) (.cse211 (or .cse0 (and (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse515 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse514 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse513 (select .cse515 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse513) (bvule .cse514 (select .cse515 v_arrayElimCell_187)) (bvule .cse514 (select .cse515 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse514 .cse513))))) .cse135) .cse516 .cse517))) (.cse90 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse512 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse509 (select .cse512 v_arrayElimCell_187)) (.cse508 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse508 .cse509) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse511 (select .cse512 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse510 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse510 .cse511) (bvule .cse510 .cse509)))) (bvule .cse508 .cse511))))))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse512 v_arrayElimCell_180))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse91 (or .cse86 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse506 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse507 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse505 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse504 (select .cse506 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse504) (bvule .cse505 (select .cse506 v_arrayElimCell_187)) (bvule .cse507 .cse504) (bvule .cse507 (select .cse506 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse505 .cse504))))))) (.cse92 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse503 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse502 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse499 (select .cse502 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse500 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse498 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse498 .cse499) (forall ((v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse501 (select .cse502 v_arrayElimCell_187))) (or (bvule .cse500 .cse501) (bvule .cse498 .cse501) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))))) (bvule .cse500 .cse499)))) (bvule .cse503 .cse499)))) (bvule .cse503 (select .cse502 v_arrayElimCell_180)))))))) (.cse95 (or (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse488 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse488) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse488) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse489 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse489 .cse139) (bvule .cse489 .cse488))))))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse494 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse490 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse493 (select .cse494 v_arrayElimCell_187)) (.cse492 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse491 (select .cse494 v_arrayElimCell_184))) (or (bvule .cse490 .cse491) (bvule .cse492 .cse493) (bvule .cse490 .cse493) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse491) (bvule .cse492 .cse491))))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse497 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse496 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse495 (select .cse497 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse495) (bvule .cse496 (select .cse497 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse495) (bvule .cse496 .cse495))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) .cse131)) (.cse96 (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse487 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse485 (select .cse487 v_arrayElimCell_180)) (.cse486 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse485) (bvule .cse486 .cse485) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse486 (select .cse487 v_arrayElimCell_184)))))) .cse252)) (.cse98 (or .cse86 (and .cse482 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse484 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse483 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse483 .cse139) (bvule .cse483 (select .cse484 v_arrayElimCell_184))))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse484 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))))) (.cse99 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse481 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse479 (select .cse481 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse479) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse480 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse480 .cse479) (bvule .cse480 .cse139) (bvule .cse480 (select .cse481 v_arrayElimCell_184))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse100 (or .cse0 (and .cse104 (or .cse323 .cse34)))) (.cse14 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse478 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse477 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse477) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse477) (bvule .cse478 .cse139) (bvule .cse478 .cse18) (bvule .cse478 .cse477))))))) (.cse27 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse476 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse475 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse474 (select .cse476 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse474) (bvule .cse475 (select .cse476 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse474) (bvule .cse475 .cse18) (bvule .cse475 .cse474))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse30 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse473 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse470 (select .cse473 v_arrayElimCell_187)) (.cse469 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse469 .cse470) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse472 (select .cse473 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse471 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse471 .cse472) (bvule .cse471 .cse470)))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse472) (bvule .cse469 .cse472)))) (bvule .cse469 .cse18))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse24 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse465 (bvadd v_arrayElimCell_182 (_ bv8 32)))) (or (bvule .cse465 .cse18) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse468 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse466 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse467 (select .cse468 v_arrayElimCell_184))) (or (bvule .cse466 .cse467) (bvule .cse466 (select .cse468 v_arrayElimCell_187)) (bvule .cse465 .cse467) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse467))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))))) (.cse25 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse462 (bvadd v_arrayElimCell_182 (_ bv8 32)))) (or (bvule .cse462 .cse18) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse463 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse463) (bvule .cse462 .cse463) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse464 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse464 .cse139) (bvule .cse464 .cse18) (bvule .cse464 .cse463)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse28 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse461 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse459 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse459) (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse460 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse460 .cse139) (bvule .cse460 .cse459)))) (bvule .cse461 .cse459)))) (bvule .cse461 .cse139) (bvule .cse461 .cse18)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse73 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse456 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse457 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse458 (select .cse456 v_arrayElimCell_180)) (.cse455 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse454 (select .cse456 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse454) (bvule .cse455 (select .cse456 v_arrayElimCell_187)) (bvule .cse457 .cse454) (bvule .cse457 .cse458) (bvule .cse455 .cse458) (bvule .cse455 .cse454))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse105 (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse453 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse452 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse451 (select .cse453 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse451) (bvule .cse452 (select .cse453 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse451) (bvule .cse452 (select .cse453 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse452 .cse451))))))) (.cse102 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse450 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse447 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse448 (select .cse450 v_arrayElimCell_180)) (.cse449 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse446 (select .cse450 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse446) (bvule .cse447 .cse446) (bvule .cse447 .cse448) (bvule .cse449 .cse139) (bvule .cse449 .cse448) (bvule .cse449 .cse446))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse107 (or .cse252 (and (or .cse0 (and (or .cse34 .cse318) .cse319)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse445 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse444 (select .cse445 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse443 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse443 .cse444) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (bvule .cse443 (select .cse445 v_arrayElimCell_184)))))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse444))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))))) (.cse113 (or .cse0 .cse284 .cse34)) (.cse114 (or .cse86 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse442 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse441 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse440 (select .cse442 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse440) (bvule .cse441 (select .cse442 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse442 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (bvule .cse441 .cse440))))))) (.cse115 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse439 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse436 (select .cse439 v_arrayElimCell_187)) (.cse435 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse435 .cse436) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse438 (select .cse439 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse437 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse437 .cse438) (bvule .cse437 .cse436)))) (bvule .cse435 .cse438))))))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse439 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse64 (or .cse86 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse434 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse433 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse432 (select .cse434 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse432) (bvule .cse433 (select .cse434 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse434 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse433 .cse432))))))) (.cse68 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse431 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse428 (select .cse431 v_arrayElimCell_187)) (.cse427 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse427 .cse428) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse430 (select .cse431 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse429 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse429 .cse430) (bvule .cse429 .cse428)))) (bvule .cse427 .cse430))))))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse431 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse85 (or .cse0 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse425 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse424 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse426 (select .cse425 v_arrayElimCell_187))) (or (bvule .cse424 (select .cse425 v_arrayElimCell_184)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse426) (bvule .cse424 .cse426) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse425 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))))))) (.cse10 (or .cse417 .cse131)) (.cse125 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse421 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse420 (select .cse421 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse419 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse419 .cse420) (bvule .cse419 (select .cse421 v_arrayElimCell_187))))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse420)))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse421 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse422 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse422 v_arrayElimCell_180)) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse423 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse423 (select .cse422 v_arrayElimCell_184)) (bvule .cse423 (select .cse422 v_arrayElimCell_187)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))))) (.cse231 (or .cse131 (and (or .cse417 .cse135) .cse159 .cse418 .cse160))) (.cse126 (or .cse86 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse415 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse414 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse414 .cse139) (bvule .cse414 (select .cse415 v_arrayElimCell_184))))) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse415 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) .cse416))) (.cse127 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse413 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse407 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse410 (select .cse413 v_arrayElimCell_187)) (.cse412 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse411 (select .cse413 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse409 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse408 (select .cse413 v_arrayElimCell_184))) (or (bvule .cse407 .cse408) (bvule .cse409 .cse410) (bvule .cse407 .cse410) (bvule .cse409 .cse411) (bvule .cse412 .cse408) (bvule .cse412 .cse411) (bvule .cse409 .cse408))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) (.cse13 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse178 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (.cse327 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse406 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse405 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse404 (select .cse406 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse404) (bvule .cse405 (select .cse406 v_arrayElimCell_187)) (bvule .cse140 .cse404) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse405 .cse18) (bvule .cse405 .cse404))))))) (and (or .cse0 (and .cse1 .cse2)) (or (let ((.cse26 (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse134 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse132 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse133 (select .cse134 v_arrayElimCell_184))) (or (bvule .cse132 .cse133) (bvule .cse132 (select .cse134 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse133) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse133))))) .cse131)) (.cse29 (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse130 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse128 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse129 (select .cse130 v_arrayElimCell_184))) (or (bvule .cse128 .cse129) (bvule .cse128 (select .cse130 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse129) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse129))))) .cse131))) (and (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (or .cse0 (and .cse14 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse19 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse15 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse17 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse16 (select .cse19 v_arrayElimCell_184))) (or (bvule .cse15 .cse16) (bvule .cse17 .cse18) (bvule .cse15 (select .cse19 v_arrayElimCell_187)) (bvule .cse17 .cse16) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse16))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse23 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse21 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse22 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse20 (select .cse23 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse20) (bvule .cse21 .cse18) (bvule .cse22 (select .cse23 v_arrayElimCell_187)) (bvule .cse21 .cse20) (bvule .cse22 .cse18) (bvule .cse22 .cse20))))))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30)) (or .cse0 (and .cse31 .cse32 .cse33 (or .cse34 .cse35))) .cse36 .cse37 .cse38 .cse39 (or .cse0 (and .cse40 .cse41 .cse42 .cse43)) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse54 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse50 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse53 (select .cse54 v_arrayElimCell_187)) (.cse52 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse51 (select .cse54 v_arrayElimCell_184))) (or (bvule .cse50 .cse51) (bvule .cse52 .cse53) (bvule .cse50 .cse53) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse51) (bvule .cse52 .cse18) (bvule .cse52 .cse51))))))) .cse55)) .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 (or .cse0 (and .cse78 .cse79 .cse80 .cse81 .cse82 .cse26 .cse83 .cse29 .cse84)) .cse85 (or .cse86 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse87 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse88 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse87 (select .cse88 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse88 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse87 (select .cse88 v_arrayElimCell_184)))))) .cse89 .cse90 .cse91 .cse92 .cse93 .cse94 .cse95 .cse96 .cse97 .cse98 .cse99 .cse100 .cse101 .cse102 (or .cse0 (and .cse103 .cse40 .cse104 .cse41)) .cse105 .cse106 .cse107 (or .cse0 (and .cse108 .cse109 .cse110 .cse111 .cse112)) .cse113 .cse114 .cse115 .cse116 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse122 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse117 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse120 (select .cse122 v_arrayElimCell_187)) (.cse121 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse119 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse118 (select .cse122 v_arrayElimCell_184))) (or (bvule .cse117 .cse118) (bvule .cse119 .cse120) (bvule .cse117 .cse120) (bvule .cse121 .cse118) (bvule .cse121 (select .cse122 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule .cse119 .cse118))))))) (or .cse0 (and .cse123 .cse124 .cse31 .cse32)) .cse125 .cse126 .cse127)) .cse135) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse141 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse138 (select .cse141 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse137 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse136 (select .cse141 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse136) (bvule .cse137 .cse138) (bvule .cse137 .cse139) (bvule .cse140 .cse136) (bvule .cse140 .cse138) (bvule .cse137 .cse136))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (or .cse86 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse144 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse143 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse142 (select .cse144 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse142) (bvule .cse143 (select .cse144 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse144 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (bvule .cse143 .cse142)))))) (or .cse0 (and .cse31 (or (and .cse32 (or .cse145 .cse35)) .cse135) (or .cse145 .cse146))) (or .cse86 (and .cse147 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse149 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse148 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse148 .cse139) (bvule .cse148 (select .cse149 v_arrayElimCell_184))))) (bvule .cse140 (select .cse149 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))))) (or (and .cse150 .cse151 .cse152 (or .cse153 .cse86)) .cse131) (or (and (or (and .cse154 .cse155 .cse156) .cse135) .cse157 .cse158 .cse159 .cse160) .cse131) (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))) (or .cse0 (and .cse109 (or (and .cse108 .cse110) .cse135) .cse111 .cse112)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse165 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse162 (select .cse165 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse163 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse161 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse161 .cse162) (forall ((v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse164 (select .cse165 v_arrayElimCell_187))) (or (bvule .cse163 .cse164) (bvule .cse161 .cse164) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))))) (bvule .cse163 .cse162)))) (bvule .cse140 .cse162)))) (bvule .cse140 (select .cse165 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (or .cse0 (and (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse170 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse166 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse169 (select .cse170 v_arrayElimCell_187)) (.cse168 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse167 (select .cse170 v_arrayElimCell_184))) (or (bvule .cse166 .cse167) (bvule .cse168 .cse169) (bvule .cse166 .cse169) (bvule .cse140 .cse167) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse168 .cse18) (bvule .cse168 .cse167))))) .cse135) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse173 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse171 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse172 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule .cse171 .cse139) (bvule .cse171 .cse172) (bvule .cse140 .cse172) (bvule .cse173 .cse172)))) (bvule .cse173 .cse139) (bvule .cse173 .cse18)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))))) (or .cse86 (and .cse108 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse176 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse175 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse174 (select .cse176 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse174) (bvule .cse175 (select .cse176 v_arrayElimCell_187)) (bvule .cse140 (select .cse176 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule .cse175 .cse174))))))))) (or .cse177 .cse135) (or .cse0 .cse178) (or .cse178 .cse135) (or .cse13 (let ((.cse203 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse237 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse233 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse236 (select .cse237 v_arrayElimCell_187)) (.cse235 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse234 (select .cse237 v_arrayElimCell_184))) (or (bvule .cse233 .cse234) (bvule .cse235 .cse236) (bvule .cse233 .cse236) (bvule .cse140 .cse234) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse237 v_arrayElimCell_180)) (bvule .cse235 .cse234))))))) (and .cse179 (or .cse0 (and (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse180 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) (select .cse180 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse180 v_arrayElimCell_180))))) .cse135) .cse181)) .cse3 (or .cse0 (and .cse182 .cse183 (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse186 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse184 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse185 (select .cse186 v_arrayElimCell_184))) (or (bvule .cse184 .cse185) (bvule .cse184 (select .cse186 v_arrayElimCell_187)) (bvule .cse140 .cse185) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse186 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse185))))) .cse135) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse189 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse190 (select .cse189 v_arrayElimCell_180)) (.cse188 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse187 (select .cse189 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse187) (bvule .cse188 (select .cse189 v_arrayElimCell_187)) (bvule .cse140 .cse187) (bvule .cse188 .cse190) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 .cse190) (bvule .cse188 .cse187))))) .cse135) .cse191 (or (and .cse192 .cse193) .cse135) .cse194)) .cse195 .cse196 .cse197 .cse6 .cse198 .cse199 .cse200 .cse201 .cse202 .cse7 (or .cse203 .cse86) .cse204 (or (and .cse205 .cse206) .cse135) (or .cse203 .cse135) (or (and .cse207 .cse208 .cse209 .cse10 .cse210) .cse135) .cse211 .cse212 (or .cse0 (and (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse215 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse213 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse214 (select .cse215 v_arrayElimCell_184))) (or (bvule .cse213 .cse214) (bvule .cse213 (select .cse215 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse215 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse214))))) .cse135) .cse216)) (or .cse86 (and .cse39 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse217 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse218 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse217 (select .cse218 v_arrayElimCell_187)) (bvule .cse140 (select .cse218 v_arrayElimCell_180)) (bvule .cse217 (select .cse218 v_arrayElimCell_184))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))))) (or (and .cse39 .cse219 .cse220 .cse12) .cse135) .cse221 .cse222 .cse223 (or .cse0 (and (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse228 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse224 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse227 (select .cse228 v_arrayElimCell_187)) (.cse226 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse225 (select .cse228 v_arrayElimCell_184))) (or (bvule .cse224 .cse225) (bvule .cse226 .cse227) (bvule .cse224 .cse227) (bvule .cse140 .cse225) (bvule .cse226 (select .cse228 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse226 .cse225))))) .cse135) .cse229)) .cse230 .cse231 .cse232))) (or (and .cse37 (or (and .cse238 (or .cse145 .cse239)) .cse0) (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse242 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse241 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse240 (select .cse242 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse240) (bvule .cse241 (select .cse242 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse242 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule .cse241 .cse240))))) .cse86) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse247 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse244 (select .cse247 v_arrayElimCell_187)) (.cse243 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse243 .cse244) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse246 (select .cse247 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse245 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse245 .cse246) (bvule .cse245 .cse244)))) (bvule .cse243 .cse246))))))) (bvule .cse140 (select .cse247 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (or .cse145 .cse0 .cse248)) .cse135) (or .cse0 (and (or (and .cse238 .cse40) .cse135) .cse41 .cse249)) (or .cse86 (and .cse39 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse250 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse251 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse250 (select .cse251 v_arrayElimCell_187)) (bvule .cse140 (select .cse251 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule .cse250 (select .cse251 v_arrayElimCell_184))))))))) (or .cse178 .cse131) (or .cse86 .cse177) (or .cse252 (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse254 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse253 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse253) (bvule .cse140 .cse253) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse254 .cse18) (bvule .cse254 .cse253))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse256 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse255 (select .cse256 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse255) (bvule .cse140 .cse255) (bvule .cse140 (select .cse256 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse255))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse260 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse259 (select .cse260 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse257 (select .cse260 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse257) (bvule .cse140 .cse257) (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse258 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse258 .cse259) (bvule .cse258 .cse257))))))) (bvule .cse140 .cse259))))))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse263 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse261 (select .cse263 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (bvule .cse140 .cse261) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse262 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse262 .cse261) (bvule .cse262 .cse139) (bvule .cse262 (select .cse263 v_arrayElimCell_184))))))))))) (or .cse86 .cse264 .cse131) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse269 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse266 (select .cse269 v_arrayElimCell_187)) (.cse265 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse265 .cse266) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse268 (select .cse269 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse267 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse267 .cse268) (bvule .cse267 .cse266)))) (bvule .cse265 .cse268))))))) (bvule .cse140 (select .cse269 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse275 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse270 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse273 (select .cse275 v_arrayElimCell_187)) (.cse274 (select .cse275 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse272 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse271 (select .cse275 v_arrayElimCell_184))) (or (bvule .cse270 .cse271) (bvule .cse272 .cse273) (bvule .cse270 .cse273) (bvule .cse272 .cse274) (bvule .cse140 .cse271) (bvule .cse140 .cse274) (bvule .cse272 .cse271))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (or .cse252 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse278 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse277 (select .cse278 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse276 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse276 .cse277) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 .cse277) (bvule .cse276 (select .cse278 v_arrayElimCell_184))))))) (or .cse178 .cse13) (or (and (or .cse86 (and .cse147 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse279 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse140 (select .cse279 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse280 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse280 (select .cse279 v_arrayElimCell_187)) (bvule .cse280 (select .cse279 v_arrayElimCell_184)))))))))))) .cse39 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse282 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse283 (select .cse282 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse281 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse281 (select .cse282 v_arrayElimCell_187)) (bvule .cse281 .cse283) (bvule .cse281 (select .cse282 v_arrayElimCell_184))))) (bvule .cse140 .cse283))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) .cse48) .cse135) (or .cse131 (and (or .cse0 .cse284) (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_187 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse285 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse286 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse285 (select .cse286 v_arrayElimCell_184)) (bvule .cse285 (select .cse286 v_arrayElimCell_187))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_187 (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse289 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse288 (select .cse289 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse287 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse287 .cse288) (bvule .cse287 (select .cse289 v_arrayElimCell_187))))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse288))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))))) (or .cse86 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse292 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse291 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse290 (select .cse292 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse290) (bvule .cse291 (select .cse292 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_187) (bvule .cse291 .cse290)))))) .cse293)) (or (and .cse179 .cse207 (or .cse0 (and .cse40 .cse41 .cse216 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse296 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse294 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse295 (select .cse296 v_arrayElimCell_184))) (or (bvule .cse294 .cse295) (bvule .cse294 (select .cse296 v_arrayElimCell_187)) (bvule .cse140 (select .cse296 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse295))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))))) .cse37 .cse39 .cse195 .cse196 .cse205 .cse197 (or .cse0 (and .cse31 .cse32 .cse181 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse297 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) (select .cse297 v_arrayElimCell_187)) (bvule .cse140 (select .cse297 v_arrayElimCell_180))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))))) .cse198 .cse199 .cse200 .cse219 .cse60 .cse62 .cse201 .cse202 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse300 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse298 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse299 (select .cse300 v_arrayElimCell_184))) (or (bvule .cse298 .cse299) (bvule .cse298 (select .cse300 v_arrayElimCell_187)) (bvule .cse140 .cse299) (bvule .cse140 (select .cse300 v_arrayElimCell_180)) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse299))))))) .cse301 .cse182 .cse183 .cse302 .cse192 .cse191 .cse193 .cse194)) .cse208 (or .cse0 (and .cse229 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse307 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse303 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse306 (select .cse307 v_arrayElimCell_187)) (.cse305 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse304 (select .cse307 v_arrayElimCell_184))) (or (bvule .cse303 .cse304) (bvule .cse305 .cse306) (bvule .cse303 .cse306) (bvule .cse140 .cse304) (bvule .cse305 (select .cse307 v_arrayElimCell_180)) (bvule .cse305 .cse304))))))))) .cse206 .cse204 .cse209 .cse212 (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse308 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse309 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse308 (select .cse309 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse309 v_arrayElimCell_180)) (bvule .cse308 (select .cse309 v_arrayElimCell_184))))) .cse86) .cse221 .cse222 .cse223 .cse101 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse314 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse310 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse313 (select .cse314 v_arrayElimCell_187)) (.cse312 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse311 (select .cse314 v_arrayElimCell_184))) (or (bvule .cse310 .cse311) (bvule .cse312 .cse313) (bvule .cse310 .cse313) (bvule .cse140 .cse311) (bvule .cse140 (select .cse314 v_arrayElimCell_180)) (bvule .cse312 .cse311))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) .cse106 .cse220 .cse230 .cse232 .cse210) .cse135) (or .cse86 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse317 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse316 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse315 (select .cse317 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse315) (bvule .cse316 (select .cse317 v_arrayElimCell_187)) (bvule .cse140 .cse315) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse140 (select .cse317 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule .cse316 .cse315)))))) (or (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_ArrVal_1153 (_ BitVec 32))) (bvule .cse140 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (and (or .cse145 .cse318) .cse319)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32))) (let ((.cse322 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse321 (select .cse322 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (forall ((v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse320 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse320 .cse321) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (bvule .cse320 (select .cse322 v_arrayElimCell_184)))))) (bvule .cse140 .cse321))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) .cse252) (or .cse0 (and (or .cse145 .cse323) .cse249)) (or .cse0 (and (or (and .cse150 .cse151 .cse152) .cse131) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse324 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse324 .cse139) (bvule .cse324 .cse18) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse325 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule .cse140 .cse325) (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse326 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse326 .cse139) (bvule .cse326 .cse325)))) (bvule .cse324 .cse325))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (or .cse327 .cse145 .cse135) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse329 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse328 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse328) (bvule .cse329 .cse139) (bvule .cse140 .cse328) (bvule .cse329 .cse18) (bvule .cse329 .cse328)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) .cse301 (or (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse334 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse331 (select .cse334 v_arrayElimCell_187)) (.cse330 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse330 .cse331) (forall ((v_arrayElimCell_184 (_ BitVec 32))) (let ((.cse333 (select .cse334 v_arrayElimCell_184))) (or (forall ((v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse332 (bvadd v_arrayElimCell_186 (_ bv8 32)))) (or (bvule .cse332 .cse333) (bvule .cse332 .cse331)))) (bvule .cse140 .cse333) (bvule .cse330 .cse333)))) (bvule .cse330 .cse18))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse337 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse336 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse335 (select .cse337 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse335) (bvule .cse336 (select .cse337 v_arrayElimCell_187)) (bvule .cse140 .cse335) (bvule .cse336 .cse18) (bvule .cse336 .cse335)))))))) .cse135) (or .cse145 .cse338) (or (and (or .cse145 .cse339) .cse302) .cse135))) (or (let ((.cse365 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse396 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse391 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse394 (select .cse396 v_arrayElimCell_187)) (.cse395 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse393 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse392 (select .cse396 v_arrayElimCell_184))) (or (bvule .cse391 .cse392) (bvule .cse393 .cse394) (bvule .cse391 .cse394) (bvule .cse395 .cse392) (bvule .cse395 (select .cse396 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse393 .cse392)))))) (.cse363 (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse390 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse385 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse388 (select .cse390 v_arrayElimCell_187)) (.cse389 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse387 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse386 (select .cse390 v_arrayElimCell_184))) (or (bvule .cse385 .cse386) (bvule .cse387 .cse388) (bvule .cse385 .cse388) (bvule .cse389 .cse386) (bvule .cse389 (select .cse390 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse387 .cse386))))))) (and (or (and .cse66 .cse116) .cse135) .cse38 (or (and .cse39 .cse44 .cse4 .cse5 .cse56 .cse64 .cse8 .cse67 .cse9 .cse68 .cse73 .cse85 .cse93 .cse10 .cse97 .cse105 .cse11 .cse12 .cse125) .cse135) .cse3 .cse46 .cse47 (or (and .cse39 .cse44 .cse67 .cse12) .cse135) .cse49 (or .cse86 (and .cse39 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse340 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse341 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse340 (select .cse341 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse341 v_arrayElimCell_180)) (bvule .cse340 (select .cse341 v_arrayElimCell_184))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))))) (or (and .cse36 .cse70 .cse75 .cse94 .cse10) .cse135) (or (and .cse39 .cse45 .cse59 (or .cse0 (and .cse319 .cse342))) .cse135) (or .cse0 (and (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse347 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse343 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse346 (select .cse347 v_arrayElimCell_187)) (.cse345 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse344 (select .cse347 v_arrayElimCell_184))) (or (bvule .cse343 .cse344) (bvule .cse345 .cse346) (bvule .cse343 .cse346) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse344) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse345 .cse18) (bvule .cse345 .cse344))))) .cse135) .cse55)) (or .cse0 (and .cse104 (or .cse348 .cse34 .cse135))) (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse350 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse349 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse349) (bvule .cse350 .cse18) (bvule .cse350 .cse349)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse353 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse352 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse351 (select .cse353 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse351) (bvule .cse352 (select .cse353 v_arrayElimCell_187)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse352 .cse18) (bvule .cse352 .cse351))))) .cse135) .cse112)) .cse57 .cse6 .cse58 (or .cse0 (and (or (and .cse78 .cse81) .cse135) .cse79 .cse80 (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse356 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse357 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse358 (select .cse356 v_arrayElimCell_180)) (.cse355 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse354 (select .cse356 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse354) (bvule .cse355 (select .cse356 v_arrayElimCell_187)) (bvule .cse357 .cse354) (bvule .cse357 .cse358) (bvule .cse355 .cse358) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse355 .cse354))))) .cse135) .cse82 (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse361 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse359 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse362 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse360 (select .cse361 v_arrayElimCell_184))) (or (bvule .cse359 .cse360) (bvule .cse359 (select .cse361 v_arrayElimCell_187)) (bvule .cse362 .cse360) (bvule .cse362 (select .cse361 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse360))))) .cse135) .cse83)) .cse61 .cse63 (or .cse0 (and .cse319 .cse2)) .cse7 .cse65 .cse69 .cse71 (or .cse363 .cse135) (or .cse0 (and (or .cse34 .cse35 .cse135) .cse33)) .cse72 .cse74 (or .cse0 (and .cse124 (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse364 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) (select .cse364 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse364 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|)))))) .cse135))) (or .cse365 .cse135) .cse76 .cse77 (or .cse86 (and .cse39 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (forall ((v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse366 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse367 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (or (bvule .cse366 (select .cse367 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse367 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (bvule .cse366 (select .cse367 v_arrayElimCell_184))))))))) .cse89 .cse211 .cse90 .cse91 .cse92 .cse95 .cse96 .cse98 .cse99 .cse100 (or .cse0 (and .cse14 (or (and .cse27 .cse30) .cse135) (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse371 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse368 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse370 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse369 (select .cse371 v_arrayElimCell_184))) (or (bvule .cse368 .cse369) (bvule .cse370 .cse18) (bvule .cse368 (select .cse371 v_arrayElimCell_187)) (bvule .cse370 .cse369) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse369))))) .cse135) .cse24 .cse25 .cse28 (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse375 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse373 (bvadd v_arrayElimCell_182 (_ bv8 32))) (.cse374 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse372 (select .cse375 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse372) (bvule .cse373 .cse18) (bvule .cse374 (select .cse375 v_arrayElimCell_187)) (bvule .cse373 .cse372) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse374 .cse18) (bvule .cse374 .cse372))))) .cse135))) (or .cse86 .cse365) (or (and .cse73 .cse105) .cse135) .cse102 (or .cse0 (and (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse378 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse376 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse377 (select .cse378 v_arrayElimCell_184))) (or (bvule .cse376 .cse377) (bvule .cse376 (select .cse378 v_arrayElimCell_187)) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) (select .cse378 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule (bvadd v_arrayElimCell_185 (_ bv8 32)) .cse377))))) .cse135) .cse42)) .cse107 .cse113 .cse114 .cse115 (or (and .cse64 .cse68 .cse85 .cse10 .cse125) .cse135) .cse231 (or .cse0 (and (or (forall ((v_arrayElimCell_180 (_ BitVec 32)) (|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_182 (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse383 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse379 (bvadd v_arrayElimCell_186 (_ bv8 32))) (.cse382 (select .cse383 v_arrayElimCell_187)) (.cse381 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse380 (select .cse383 v_arrayElimCell_184))) (or (bvule .cse379 .cse380) (bvule .cse381 .cse382) (bvule .cse379 .cse382) (bvule (bvadd v_arrayElimCell_182 (_ bv8 32)) .cse380) (bvule .cse381 (select .cse383 v_arrayElimCell_180)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse381 .cse380))))) .cse135) .cse384)) (or .cse86 .cse363) .cse126 .cse127)) .cse13) (or .cse145 .cse0 .cse284) (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32))) (let ((.cse397 (bvadd v_arrayElimCell_185 (_ bv8 32)))) (or (bvule .cse397 .cse139) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse397 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))))) .cse131) (or .cse178 (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~malloc3#1.offset|) .cse140)) (or .cse0 (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32)) (v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse399 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse398 (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153) v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse398) (bvule .cse399 .cse139) (bvule .cse140 .cse398) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))) (bvule .cse399 .cse18) (bvule .cse399 .cse398))))) (or (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_26| (_ BitVec 32))) (or (forall ((v_arrayElimCell_184 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_ArrVal_1153 (_ BitVec 32)) (v_arrayElimCell_185 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse402 (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_26| v_ArrVal_1153))) (let ((.cse403 (select .cse402 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse401 (bvadd v_arrayElimCell_185 (_ bv8 32))) (.cse400 (select .cse402 v_arrayElimCell_184))) (or (bvule (bvadd v_arrayElimCell_186 (_ bv8 32)) .cse400) (bvule .cse401 (select .cse402 v_arrayElimCell_187)) (bvule .cse401 .cse403) (bvule .cse140 .cse400) (bvule .cse140 .cse403) (bvule .cse401 .cse400))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_26|))))) (or .cse327 .cse0)) .cse135) (or .cse0 .cse264))))))) is different from true