./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.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_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/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_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/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_6acf749d-ca6c-45cb-89e4-7bc18858feec/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 a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:00:20,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:00:20,520 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:00:20,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:00:20,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:00:20,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:00:20,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:00:20,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:00:20,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:00:20,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:00:20,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:00:20,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:00:20,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:00:20,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:00:20,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:00:20,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:00:20,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:00:20,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:00:20,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:00:20,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:00:20,572 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:00:20,573 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:00:20,574 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:00:20,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:00:20,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:00:20,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:00:20,574 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:00:20,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:00:20,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:00:20,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:00:20,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:00:20,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:00:20,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:00:20,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:00:20,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:00:20,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:00:20,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:00:20,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:00:20,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:00:20,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:00:20,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:00:20,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:00:20,578 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_6acf749d-ca6c-45cb-89e4-7bc18858feec/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 -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2024-11-13 13:00:20,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:00:20,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:00:20,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:00:20,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:00:20,935 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:00:20,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i Unable to find full path for "g++" [2024-11-13 13:00:22,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:00:23,174 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:00:23,175 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2024-11-13 13:00:23,187 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/data/ae8b71d4b/9fb63942f4a9437a99c48559285a779d/FLAG0c5c09734 [2024-11-13 13:00:23,203 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/data/ae8b71d4b/9fb63942f4a9437a99c48559285a779d [2024-11-13 13:00:23,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:00:23,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:00:23,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:00:23,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:00:23,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:00:23,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3711d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23, skipping insertion in model container [2024-11-13 13:00:23,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:00:23,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:00:23,572 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:00:23,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:00:23,660 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:00:23,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23 WrapperNode [2024-11-13 13:00:23,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:00:23,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:00:23,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:00:23,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:00:23,669 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:00:23" (1/1) ... [2024-11-13 13:00:23,679 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:00:23" (1/1) ... [2024-11-13 13:00:23,704 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2024-11-13 13:00:23,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:00:23,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:00:23,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:00:23,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:00:23,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,759 INFO L175 MemorySlicer]: Split 23 memory accesses to 3 slices as follows [2, 7, 14]. 61 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-13 13:00:23,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:00:23,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:00:23,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:00:23,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:00:23,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (1/1) ... [2024-11-13 13:00:23,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:00:23,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:23,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/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:00:23,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/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:00:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-13 13:00:23,858 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-13 13:00:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:00:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:00:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 13:00:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:00:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 13:00:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:00:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 13:00:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 13:00:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 13:00:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:00:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:00:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:00:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:00:23,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:00:24,003 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:00:24,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:00:24,030 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-13 13:00:24,468 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-13 13:00:24,468 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:00:24,486 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:00:24,486 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 13:00:24,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:24 BoogieIcfgContainer [2024-11-13 13:00:24,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:00:24,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:00:24,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:00:24,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:00:24,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:00:23" (1/3) ... [2024-11-13 13:00:24,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52db9aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:00:24, skipping insertion in model container [2024-11-13 13:00:24,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:23" (2/3) ... [2024-11-13 13:00:24,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52db9aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:00:24, skipping insertion in model container [2024-11-13 13:00:24,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:24" (3/3) ... [2024-11-13 13:00:24,496 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2024-11-13 13:00:24,512 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:00:24,513 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_prepend_unequal.i that has 2 procedures, 106 locations, 1 initial locations, 3 loop locations, and 45 error locations. [2024-11-13 13:00:24,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:00:24,590 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;@49706eac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:00:24,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-11-13 13:00:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 57 states have (on average 2.0350877192982457) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:24,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:00:24,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:24,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:00:24,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:24,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:24,611 INFO L85 PathProgramCache]: Analyzing trace with hash 33470383, now seen corresponding path program 1 times [2024-11-13 13:00:24,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:24,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167712308] [2024-11-13 13:00:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:24,893 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:00:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167712308] [2024-11-13 13:00:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167712308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:24,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:24,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:00:24,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591934315] [2024-11-13 13:00:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:24,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:00:24,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:00:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:00:24,932 INFO L87 Difference]: Start difference. First operand has 105 states, 57 states have (on average 2.0350877192982457) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:00:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:25,105 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-11-13 13:00:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:00:25,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-13 13:00:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:25,115 INFO L225 Difference]: With dead ends: 101 [2024-11-13 13:00:25,115 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 13:00:25,117 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:00:25,120 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:25,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 13:00:25,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-13 13:00:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 94 states have internal predecessors, (101), 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:00:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-11-13 13:00:25,170 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 5 [2024-11-13 13:00:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:25,170 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-11-13 13:00:25,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:00:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-11-13 13:00:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:00:25,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:25,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:00:25,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:00:25,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:25,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash 33470384, now seen corresponding path program 1 times [2024-11-13 13:00:25,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:25,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724667777] [2024-11-13 13:00:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:25,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:25,357 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:00:25,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:25,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724667777] [2024-11-13 13:00:25,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724667777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:25,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:25,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:00:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690493615] [2024-11-13 13:00:25,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:25,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:00:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:25,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:00:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:00:25,361 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:00:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:25,481 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-11-13 13:00:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:00:25,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-13 13:00:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:25,486 INFO L225 Difference]: With dead ends: 92 [2024-11-13 13:00:25,486 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 13:00:25,486 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:00:25,487 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:25,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 13:00:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 13:00:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.849056603773585) internal successors, (98), 91 states have internal predecessors, (98), 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:00:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-11-13 13:00:25,500 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 5 [2024-11-13 13:00:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:25,500 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-11-13 13:00:25,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:00:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-11-13 13:00:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 13:00:25,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:25,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:25,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:00:25,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:25,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2099158735, now seen corresponding path program 1 times [2024-11-13 13:00:25,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:25,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854645008] [2024-11-13 13:00:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:25,592 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:00:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:25,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854645008] [2024-11-13 13:00:25,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854645008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:25,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:25,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:00:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920607221] [2024-11-13 13:00:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:25,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:00:25,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:25,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:00:25,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:00:25,594 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:00:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:25,616 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2024-11-13 13:00:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:00:25,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-13 13:00:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:25,618 INFO L225 Difference]: With dead ends: 102 [2024-11-13 13:00:25,620 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 13:00:25,621 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:00:25,621 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:25,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 189 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:00:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 13:00:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2024-11-13 13:00:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 92 states have internal predecessors, (99), 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:00:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2024-11-13 13:00:25,636 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 7 [2024-11-13 13:00:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:25,636 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2024-11-13 13:00:25,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:00:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2024-11-13 13:00:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:00:25,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:25,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:25,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:00:25,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:25,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash -278170765, now seen corresponding path program 1 times [2024-11-13 13:00:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:25,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222297656] [2024-11-13 13:00:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:25,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:25,739 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:00:25,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:25,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222297656] [2024-11-13 13:00:25,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222297656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:25,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:25,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:00:25,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252284531] [2024-11-13 13:00:25,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:25,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:00:25,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:25,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:00:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:00:25,741 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:25,765 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-13 13:00:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:00:25,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 13:00:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:25,767 INFO L225 Difference]: With dead ends: 98 [2024-11-13 13:00:25,767 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 13:00:25,767 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:00:25,768 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:25,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:00:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 13:00:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-13 13:00:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 97 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:00:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2024-11-13 13:00:25,773 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 9 [2024-11-13 13:00:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:25,774 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-11-13 13:00:25,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2024-11-13 13:00:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 13:00:25,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:25,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:25,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:00:25,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:25,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 248872223, now seen corresponding path program 1 times [2024-11-13 13:00:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072918144] [2024-11-13 13:00:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:25,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:25,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072918144] [2024-11-13 13:00:25,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072918144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:25,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205192310] [2024-11-13 13:00:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:25,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:25,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:25,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:25,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:00:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:26,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:00:26,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:26,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:26,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205192310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:26,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:26,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-13 13:00:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728624355] [2024-11-13 13:00:26,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:26,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:00:26,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:26,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:00:26,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:00:26,230 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:26,259 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-13 13:00:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:00:26,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 13:00:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:26,261 INFO L225 Difference]: With dead ends: 100 [2024-11-13 13:00:26,261 INFO L226 Difference]: Without dead ends: 100 [2024-11-13 13:00:26,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:00:26,262 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:26,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 273 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:00:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-13 13:00:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-13 13:00:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.7377049180327868) internal successors, (106), 99 states have internal predecessors, (106), 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:00:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2024-11-13 13:00:26,275 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 14 [2024-11-13 13:00:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:26,276 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2024-11-13 13:00:26,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2024-11-13 13:00:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:00:26,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:26,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:26,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:00:26,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:26,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:26,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash -287048253, now seen corresponding path program 1 times [2024-11-13 13:00:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:26,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285474905] [2024-11-13 13:00:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:26,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285474905] [2024-11-13 13:00:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285474905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847571434] [2024-11-13 13:00:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:26,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:26,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:26,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:26,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:00:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:26,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:00:26,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:26,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:26,934 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 13:00:26,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-13 13:00:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:26,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:27,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847571434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:27,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:27,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-13 13:00:27,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161207747] [2024-11-13 13:00:27,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:27,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:00:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:27,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:00:27,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:00:27,027 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:27,209 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-13 13:00:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:00:27,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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:00:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:27,211 INFO L225 Difference]: With dead ends: 99 [2024-11-13 13:00:27,211 INFO L226 Difference]: Without dead ends: 99 [2024-11-13 13:00:27,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:00:27,212 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 4 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:27,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:00:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-13 13:00:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-13 13:00:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.721311475409836) internal successors, (105), 98 states have internal predecessors, (105), 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:00:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2024-11-13 13:00:27,220 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 16 [2024-11-13 13:00:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:27,221 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2024-11-13 13:00:27,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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:00:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2024-11-13 13:00:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:00:27,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:27,224 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:27,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:00:27,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 13:00:27,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:27,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash -287048252, now seen corresponding path program 1 times [2024-11-13 13:00:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:27,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650305228] [2024-11-13 13:00:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:27,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:27,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:27,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650305228] [2024-11-13 13:00:27,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650305228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:27,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135115313] [2024-11-13 13:00:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:27,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:27,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:27,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:27,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:00:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:27,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 13:00:27,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:27,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 8 treesize of output 1 [2024-11-13 13:00:27,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:28,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:28,072 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:00:28,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:00:28,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:00:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:28,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:28,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135115313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:28,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:28,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-13 13:00:28,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014532529] [2024-11-13 13:00:28,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:28,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:00:28,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:28,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:00:28,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:00:28,541 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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:00:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:28,887 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-13 13:00:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:00:28,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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 16 [2024-11-13 13:00:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:28,888 INFO L225 Difference]: With dead ends: 98 [2024-11-13 13:00:28,888 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 13:00:28,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:00:28,889 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:28,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 330 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:00:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 13:00:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-13 13:00:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.7049180327868851) internal successors, (104), 97 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:00:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2024-11-13 13:00:28,898 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 16 [2024-11-13 13:00:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:28,898 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-11-13 13:00:28,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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:00:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2024-11-13 13:00:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 13:00:28,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:28,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:28,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:00:29,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:29,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:29,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash -5839665, now seen corresponding path program 2 times [2024-11-13 13:00:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:29,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250557927] [2024-11-13 13:00:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:29,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:29,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250557927] [2024-11-13 13:00:29,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250557927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372068697] [2024-11-13 13:00:29,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:00:29,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:29,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:29,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:29,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:00:29,383 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 13:00:29,383 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:00:29,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:00:29,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:29,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:00:29,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:00:29,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372068697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:29,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:00:29,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-13 13:00:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445162558] [2024-11-13 13:00:29,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:29,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:00:29,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:29,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:00:29,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:00:29,404 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:00:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:29,496 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2024-11-13 13:00:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:00:29,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2024-11-13 13:00:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:29,497 INFO L225 Difference]: With dead ends: 95 [2024-11-13 13:00:29,497 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 13:00:29,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:00:29,498 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:29,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 131 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 13:00:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-13 13:00:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 94 states have internal predecessors, (101), 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:00:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-11-13 13:00:29,508 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 21 [2024-11-13 13:00:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:29,508 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-11-13 13:00:29,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:00:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-11-13 13:00:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 13:00:29,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:29,509 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:29,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:00:29,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:29,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:29,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash -5839664, now seen corresponding path program 1 times [2024-11-13 13:00:29,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:29,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525333706] [2024-11-13 13:00:29,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:29,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:29,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:29,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525333706] [2024-11-13 13:00:29,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525333706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:29,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831685297] [2024-11-13 13:00:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:29,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:29,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:29,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:29,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:00:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:29,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:00:29,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:30,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:00:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831685297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:00:30,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:00:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-13 13:00:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132108904] [2024-11-13 13:00:30,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:00:30,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:00:30,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:00:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:00:30,051 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:30,097 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-13 13:00:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:00:30,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-13 13:00:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:30,098 INFO L225 Difference]: With dead ends: 95 [2024-11-13 13:00:30,098 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 13:00:30,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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:00:30,099 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:30,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 248 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:00:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 13:00:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-13 13:00:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.639344262295082) internal successors, (100), 94 states have internal predecessors, (100), 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:00:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-13 13:00:30,105 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 21 [2024-11-13 13:00:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:30,105 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-13 13:00:30,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-13 13:00:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 13:00:30,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:30,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:30,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:00:30,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:30,307 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:30,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash -563203316, now seen corresponding path program 1 times [2024-11-13 13:00:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449827518] [2024-11-13 13:00:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:00:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:30,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449827518] [2024-11-13 13:00:30,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449827518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:30,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:30,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:00:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677562820] [2024-11-13 13:00:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:30,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:00:30,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:00:30,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:00:30,472 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:00:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:30,548 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-13 13:00:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:00:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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 22 [2024-11-13 13:00:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:30,549 INFO L225 Difference]: With dead ends: 92 [2024-11-13 13:00:30,549 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 13:00:30,549 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:00:30,550 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:30,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 135 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:00:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 13:00:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 13:00:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 91 states have internal predecessors, (97), 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:00:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-13 13:00:30,554 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 22 [2024-11-13 13:00:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:30,554 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-13 13:00:30,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:00:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-13 13:00:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:00:30,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:30,555 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:30,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:00:30,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:00:30,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:30,555 INFO L85 PathProgramCache]: Analyzing trace with hash 299379093, now seen corresponding path program 1 times [2024-11-13 13:00:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:30,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778726489] [2024-11-13 13:00:30,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:00:30,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778726489] [2024-11-13 13:00:30,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778726489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210580577] [2024-11-13 13:00:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:31,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:31,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:31,002 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:31,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:00:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:31,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:00:31,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:31,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:00:31,236 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:00:31,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 13:00:31,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:31,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 13:00:31,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:00:31,649 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-13 13:00:31,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-13 13:00:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:31,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:01:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210580577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:01:24,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:01:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-13 13:01:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390198372] [2024-11-13 13:01:24,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:01:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:01:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:01:24,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=189, Unknown=13, NotChecked=0, Total=272 [2024-11-13 13:01:24,257 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 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:01:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:24,621 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-13 13:01:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:01:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 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 27 [2024-11-13 13:01:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:24,623 INFO L225 Difference]: With dead ends: 98 [2024-11-13 13:01:24,623 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 13:01:24,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=113, Invalid=254, Unknown=13, NotChecked=0, Total=380 [2024-11-13 13:01:24,624 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 306 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:24,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 183 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:01:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 13:01:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2024-11-13 13:01:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 85 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:01:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-13 13:01:24,631 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 27 [2024-11-13 13:01:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-13 13:01:24,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 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:01:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-13 13:01:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:01:24,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:24,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:24,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:01:24,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:24,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:24,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:24,837 INFO L85 PathProgramCache]: Analyzing trace with hash 299379094, now seen corresponding path program 1 times [2024-11-13 13:01:24,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:24,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109532085] [2024-11-13 13:01:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 13:01:25,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:25,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109532085] [2024-11-13 13:01:25,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109532085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730980350] [2024-11-13 13:01:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:25,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:25,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:25,375 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:01:25,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:01:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:25,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 13:01:25,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:25,570 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:01:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:25,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:01:25,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:25,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:01:25,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:25,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:01:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:01:25,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:01:25,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730980350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:25,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:01:25,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-13 13:01:25,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158116447] [2024-11-13 13:01:25,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:25,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:01:25,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:25,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:01:25,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:01:25,779 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:25,895 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-11-13 13:01:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:01:25,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 13:01:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:25,897 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:01:25,897 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 13:01:25,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:01:25,897 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 61 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:25,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 98 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 13:01:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-13 13:01:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-13 13:01:25,901 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 27 [2024-11-13 13:01:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:25,902 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-13 13:01:25,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-13 13:01:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:01:25,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:25,903 INFO L215 NwaCegarLoop]: trace histogram [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:01:25,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:01:26,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 13:01:26,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:26,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash 690817331, now seen corresponding path program 1 times [2024-11-13 13:01:26,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:26,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162916633] [2024-11-13 13:01:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:26,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:01:26,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162916633] [2024-11-13 13:01:26,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162916633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:26,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:26,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:01:26,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195387925] [2024-11-13 13:01:26,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:26,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:01:26,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:01:26,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:01:26,232 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:26,360 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-11-13 13:01:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:01:26,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:01:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:26,361 INFO L225 Difference]: With dead ends: 79 [2024-11-13 13:01:26,361 INFO L226 Difference]: Without dead ends: 79 [2024-11-13 13:01:26,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:01:26,361 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:26,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 174 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-13 13:01:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-13 13:01:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-11-13 13:01:26,368 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 28 [2024-11-13 13:01:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:26,368 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-11-13 13:01:26,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-11-13 13:01:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:01:26,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:26,369 INFO L215 NwaCegarLoop]: trace histogram [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:01:26,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:01:26,369 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:26,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:26,369 INFO L85 PathProgramCache]: Analyzing trace with hash 690817332, now seen corresponding path program 1 times [2024-11-13 13:01:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:26,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672414983] [2024-11-13 13:01:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:26,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:01:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672414983] [2024-11-13 13:01:26,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672414983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:26,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:26,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:01:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295971361] [2024-11-13 13:01:26,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:26,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:01:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:01:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:01:26,569 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:26,696 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-13 13:01:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:01:26,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:01:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:26,697 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:01:26,697 INFO L226 Difference]: Without dead ends: 78 [2024-11-13 13:01:26,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:01:26,698 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:26,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 186 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-13 13:01:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-13 13:01:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.360655737704918) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-13 13:01:26,701 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 28 [2024-11-13 13:01:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:26,701 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-13 13:01:26,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-13 13:01:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:01:26,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:26,703 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:26,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:01:26,704 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:26,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:26,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1074425824, now seen corresponding path program 1 times [2024-11-13 13:01:26,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:26,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859379686] [2024-11-13 13:01:26,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:26,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:01:26,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:26,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859379686] [2024-11-13 13:01:26,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859379686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:26,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:26,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:01:26,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435011531] [2024-11-13 13:01:26,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:26,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:01:26,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:01:26,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:01:26,983 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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:01:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:27,241 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2024-11-13 13:01:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:01:27,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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:01:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:27,242 INFO L225 Difference]: With dead ends: 77 [2024-11-13 13:01:27,242 INFO L226 Difference]: Without dead ends: 77 [2024-11-13 13:01:27,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:01:27,243 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 13 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:27,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 257 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:01:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-13 13:01:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-13 13:01:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-11-13 13:01:27,247 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 33 [2024-11-13 13:01:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:27,247 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-11-13 13:01:27,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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:01:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-11-13 13:01:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:01:27,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:27,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:27,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:01:27,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1074425825, now seen corresponding path program 1 times [2024-11-13 13:01:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130052481] [2024-11-13 13:01:27,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:01:27,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:27,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130052481] [2024-11-13 13:01:27,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130052481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:27,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:27,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:01:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539800985] [2024-11-13 13:01:27,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:27,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:01:27,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:27,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:01:27,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:01:27,709 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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:01:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:27,938 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-11-13 13:01:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:01:27,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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:01:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:27,939 INFO L225 Difference]: With dead ends: 76 [2024-11-13 13:01:27,939 INFO L226 Difference]: Without dead ends: 76 [2024-11-13 13:01:27,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:01:27,940 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:27,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 248 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:01:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-13 13:01:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-13 13:01:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-11-13 13:01:27,942 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 33 [2024-11-13 13:01:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:27,943 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-11-13 13:01:27,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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:01:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-11-13 13:01:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 13:01:27,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:27,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:27,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:01:27,944 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:27,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:27,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1904244392, now seen corresponding path program 1 times [2024-11-13 13:01:27,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:27,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763557597] [2024-11-13 13:01:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:27,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:01:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763557597] [2024-11-13 13:01:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763557597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:01:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532947807] [2024-11-13 13:01:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:28,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:01:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:01:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:01:28,172 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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:01:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:28,296 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2024-11-13 13:01:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:01:28,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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:01:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:28,297 INFO L225 Difference]: With dead ends: 76 [2024-11-13 13:01:28,297 INFO L226 Difference]: Without dead ends: 76 [2024-11-13 13:01:28,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:01:28,298 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:28,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 331 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:01:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-13 13:01:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-13 13:01:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 75 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:01:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-13 13:01:28,301 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 36 [2024-11-13 13:01:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-13 13:01:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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:01:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-13 13:01:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 13:01:28,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:28,302 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:28,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:01:28,302 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:28,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash 279576870, now seen corresponding path program 1 times [2024-11-13 13:01:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:28,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964633159] [2024-11-13 13:01:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:01:28,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:28,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964633159] [2024-11-13 13:01:28,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964633159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:28,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:28,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:01:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245947829] [2024-11-13 13:01:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:28,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:01:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:28,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:01:28,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:01:28,607 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 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:01:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:28,821 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-11-13 13:01:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:01:28,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 13:01:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:28,823 INFO L225 Difference]: With dead ends: 77 [2024-11-13 13:01:28,823 INFO L226 Difference]: Without dead ends: 77 [2024-11-13 13:01:28,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:01:28,823 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 35 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:28,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:01:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-13 13:01:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-13 13:01:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:01:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-13 13:01:28,827 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 39 [2024-11-13 13:01:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:28,827 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-13 13:01:28,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 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:01:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-13 13:01:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 13:01:28,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:28,830 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:28,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:01:28,830 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:28,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash 279576871, now seen corresponding path program 1 times [2024-11-13 13:01:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:28,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418285992] [2024-11-13 13:01:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:01:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:29,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418285992] [2024-11-13 13:01:29,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418285992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:29,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:29,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:01:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814379900] [2024-11-13 13:01:29,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:29,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:01:29,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:29,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:01:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:01:29,283 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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:01:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:29,529 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-13 13:01:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:01:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 13:01:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:29,530 INFO L225 Difference]: With dead ends: 75 [2024-11-13 13:01:29,531 INFO L226 Difference]: Without dead ends: 75 [2024-11-13 13:01:29,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:01:29,532 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:29,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 237 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:01:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-13 13:01:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-13 13:01:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 70 states have internal predecessors, (75), 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:01:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-13 13:01:29,535 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 39 [2024-11-13 13:01:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:29,535 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-13 13:01:29,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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:01:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-13 13:01:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 13:01:29,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:29,538 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:29,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:01:29,538 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:29,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1141067324, now seen corresponding path program 1 times [2024-11-13 13:01:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:29,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11980364] [2024-11-13 13:01:29,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:01:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11980364] [2024-11-13 13:01:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11980364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:30,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:30,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 13:01:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160119153] [2024-11-13 13:01:30,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:30,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:01:30,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:30,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:01:30,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:01:30,474 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 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:01:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:30,925 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-13 13:01:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:01:30,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 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 43 [2024-11-13 13:01:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:30,926 INFO L225 Difference]: With dead ends: 71 [2024-11-13 13:01:30,926 INFO L226 Difference]: Without dead ends: 71 [2024-11-13 13:01:30,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:01:30,927 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:30,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 420 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:01:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-13 13:01:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-13 13:01:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 70 states have internal predecessors, (74), 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:01:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-13 13:01:30,932 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 43 [2024-11-13 13:01:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:30,932 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-13 13:01:30,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 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:01:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-13 13:01:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 13:01:30,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:30,933 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:30,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:01:30,933 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:30,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1013319478, now seen corresponding path program 1 times [2024-11-13 13:01:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:30,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022932308] [2024-11-13 13:01:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:01:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022932308] [2024-11-13 13:01:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022932308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 13:01:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283051061] [2024-11-13 13:01:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:32,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:01:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:01:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:01:32,066 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 17 states have internal predecessors, (42), 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:01:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:32,837 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-11-13 13:01:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:01:32,838 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 17 states have internal predecessors, (42), 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 44 [2024-11-13 13:01:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:32,838 INFO L225 Difference]: With dead ends: 73 [2024-11-13 13:01:32,838 INFO L226 Difference]: Without dead ends: 73 [2024-11-13 13:01:32,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:01:32,840 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:32,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 399 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:01:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-13 13:01:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-13 13:01:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 72 states have internal predecessors, (78), 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:01:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-11-13 13:01:32,842 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 44 [2024-11-13 13:01:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:32,843 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-11-13 13:01:32,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 17 states have internal predecessors, (42), 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:01:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-11-13 13:01:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 13:01:32,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:32,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:32,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 13:01:32,844 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:32,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1013319477, now seen corresponding path program 1 times [2024-11-13 13:01:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779308986] [2024-11-13 13:01:32,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:01:34,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:34,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779308986] [2024-11-13 13:01:34,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779308986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:34,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:34,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 13:01:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346821215] [2024-11-13 13:01:34,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:34,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:01:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:01:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:01:34,462 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 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:01:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:35,396 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2024-11-13 13:01:35,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:01:35,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 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 44 [2024-11-13 13:01:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:35,400 INFO L225 Difference]: With dead ends: 75 [2024-11-13 13:01:35,400 INFO L226 Difference]: Without dead ends: 75 [2024-11-13 13:01:35,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:01:35,402 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:35,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 388 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:01:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-13 13:01:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-13 13:01:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 74 states have internal predecessors, (79), 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:01:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-13 13:01:35,410 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 44 [2024-11-13 13:01:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:35,412 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-13 13:01:35,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 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:01:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-13 13:01:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 13:01:35,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:35,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:35,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 13:01:35,413 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:35,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1523349099, now seen corresponding path program 1 times [2024-11-13 13:01:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:35,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546495198] [2024-11-13 13:01:35,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:35,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:01:36,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:36,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546495198] [2024-11-13 13:01:36,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546495198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:01:36,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:01:36,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 13:01:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608256351] [2024-11-13 13:01:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:01:36,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:01:36,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:01:36,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:01:36,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:01:36,474 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 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:01:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:01:37,138 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-13 13:01:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:01:37,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-13 13:01:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:01:37,140 INFO L225 Difference]: With dead ends: 75 [2024-11-13 13:01:37,140 INFO L226 Difference]: Without dead ends: 75 [2024-11-13 13:01:37,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:01:37,141 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:01:37,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 468 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:01:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-13 13:01:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-13 13:01:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 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:01:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-13 13:01:37,147 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 47 [2024-11-13 13:01:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:01:37,147 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-13 13:01:37,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 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:01:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-13 13:01:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 13:01:37,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:01:37,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:01:37,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 13:01:37,149 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-13 13:01:37,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:01:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash 600846522, now seen corresponding path program 1 times [2024-11-13 13:01:37,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:01:37,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622375009] [2024-11-13 13:01:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:01:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:01:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622375009] [2024-11-13 13:01:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622375009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:01:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212673788] [2024-11-13 13:01:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:01:39,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:01:39,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:01:39,984 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:01:39,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6acf749d-ca6c-45cb-89e4-7bc18858feec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:01:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:01:40,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-13 13:01:40,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:40,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:01:40,423 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:01:40,424 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:01:40,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:01:40,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:01:40,659 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:01:40,659 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:01:40,947 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-13 13:01:40,947 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 36 treesize of output 52 [2024-11-13 13:01:41,104 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 50 treesize of output 33 [2024-11-13 13:01:41,150 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 50 treesize of output 33 [2024-11-13 13:01:41,210 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 50 treesize of output 33 [2024-11-13 13:01:41,615 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 59 treesize of output 42 [2024-11-13 13:01:41,637 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 19 treesize of output 1 [2024-11-13 13:01:42,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:42,089 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:42,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:42,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2024-11-13 13:01:42,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:42,130 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 30 treesize of output 17 [2024-11-13 13:01:42,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:42,379 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 102 [2024-11-13 13:01:42,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:42,392 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:42,393 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 26 [2024-11-13 13:01:42,624 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:01:42,624 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 46 treesize of output 34 [2024-11-13 13:01:42,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-13 13:01:43,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2024-11-13 13:01:43,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:43,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:01:43,470 INFO L349 Elim1Store]: treesize reduction 43, result has 15.7 percent of original size [2024-11-13 13:01:43,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 43 [2024-11-13 13:01:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:44,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:01:45,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:45,438 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 50 treesize of output 51 [2024-11-13 13:01:45,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:01:45,482 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 104 treesize of output 103 [2024-11-13 13:01:45,495 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 41 treesize of output 25 [2024-11-13 13:02:11,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:02:11,093 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 125 treesize of output 102 [2024-11-13 13:02:11,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:02:11,158 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 125 treesize of output 102 [2024-11-13 13:02:11,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:02:11,199 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 125 treesize of output 102 [2024-11-13 13:02:11,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:02:11,264 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 125 treesize of output 102 [2024-11-13 13:02:17,819 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 467 treesize of output 413 [2024-11-13 13:02:17,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:02:17,869 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 717 treesize of output 641 [2024-11-13 13:02:17,897 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 541 treesize of output 513 [2024-11-13 13:02:17,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:02:17,956 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 904 treesize of output 884 [2024-11-13 13:02:21,465 INFO L349 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2024-11-13 13:02:21,465 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 80 [2024-11-13 13:02:21,490 INFO L349 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2024-11-13 13:02:21,491 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 60 treesize of output 52 [2024-11-13 13:02:21,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:02:21,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:02:21,564 INFO L349 Elim1Store]: treesize reduction 66, result has 33.3 percent of original size [2024-11-13 13:02:21,565 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 99 treesize of output 105 [2024-11-13 13:09:41,870 WARN L286 SmtUtils]: Spent 7.31s on a formula simplification that was a NOOP. DAG size: 325 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:09:48,754 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse70 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (or (let ((.cse35 (not (= .cse70 1)))) (and (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1821 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_2 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (= (select .cse0 (select (let ((.cse1 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (select .cse1 (select (select (let ((.cse2 (select v_arrayElimArr_2 (+ v_prenex_9 4)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (+ v_prenex_7 4))) 1) (< v_prenex_8 v_prenex_7) (< v_prenex_7 0))) (not (= (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1821 Int)) (let ((.cse6 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse6 (select (let ((.cse7 (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4)) (.cse9 (select v_arrayElimArr_4 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (store .cse8 .cse9 (store (select .cse8 .cse9) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))) (not (= (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_ArrVal_1821 Int)) (let ((.cse10 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_2 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_2 (+ v_prenex_9 4)))) (= (select .cse10 (select (let ((.cse11 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (select .cse11 (select (store (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse3))) (+ v_prenex_7 4))) 1) (< v_prenex_8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7) (< v_prenex_7 0))) (not (= (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1821 Int)) (let ((.cse12 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_2 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2)) (.cse16 (+ v_prenex_9 4))) (let ((.cse14 (let ((.cse17 (select v_arrayElimArr_2 .cse16))) (store .cse13 .cse17 (store (select .cse13 .cse17) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)))) (.cse15 (+ v_prenex_7 4))) (or (< v_prenex_8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse12 (select (select .cse13 (select (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) .cse15)) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7) (= (select .cse12 (select (select .cse13 (select (select .cse14 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse16)) .cse15)) 1) (< v_prenex_7 0))))) (not (= (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1821 Int)) (let ((.cse18 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_2 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_2 (+ v_prenex_9 4)))) (= (select .cse18 (select (let ((.cse19 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (select .cse19 (select (store (select .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse3))) (+ v_prenex_7 4))) 1) (< v_prenex_8 v_prenex_7) (< v_prenex_7 0))) (not (= (select .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_ArrVal_1821 Int)) (let ((.cse20 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_2 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse20 (select (let ((.cse21 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (select .cse21 (select (select (let ((.cse22 (select v_arrayElimArr_2 (+ v_prenex_9 4)))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (+ v_prenex_7 4))) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7) (< v_prenex_7 0))) (not (= (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1821 Int)) (let ((.cse24 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_8 Int)) (or (forall ((v_prenex_7 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse25 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse23 (+ v_prenex_9 4)) (.cse27 (+ v_prenex_7 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_2 .cse23))) (= (select .cse24 (select (select .cse25 (select .cse26 .cse3)) .cse27)) 1) (= (select .cse24 (select (select .cse25 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse26) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse23)) .cse27)) 1))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7) (< v_prenex_7 0))) (< v_prenex_8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (not (= (select .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1821 Int)) (let ((.cse28 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_1 Int)) (or (< v_prenex_1 0) (forall ((v_prenex_2 Int)) (or (forall ((v_prenex_3 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse30 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (let ((.cse29 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse30)) (.cse31 (+ v_prenex_1 4)) (.cse32 (+ v_prenex_3 4))) (or (= (select .cse28 (select (select .cse29 (select .cse30 .cse3)) .cse31)) 1) (= (select .cse28 (select (select .cse29 (select (select .cse29 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse32)) .cse31)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 .cse32))))))) (< v_prenex_2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (not (= (select .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1821 Int)) (let ((.cse33 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (not (= (select .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 Int)) (or (< v_prenex_1 0) (= (select .cse33 (select (let ((.cse34 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse34) (select .cse34 .cse3))) (+ v_prenex_1 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 (+ v_prenex_3 4))))))))))) (or .cse35 (forall ((v_prenex_6 Int) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1821 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821) (select (let ((.cse36 (let ((.cse37 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5)) (.cse38 (select v_arrayElimArr_5 (+ v_prenex_6 4)))) (store .cse37 .cse38 (store (select .cse37 .cse38) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse36 (select (select .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (+ v_prenex_4 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (< v_prenex_4 0)))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_ArrVal_1821 Int)) (let ((.cse39 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= 1 (select .cse39 (select (let ((.cse40 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse40) (select .cse40 .cse3))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4)))) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (select v_arrayElimArr_4 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))) (not (= (select .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_ArrVal_1821 Int)) (let ((.cse41 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 Int)) (let ((.cse43 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (let ((.cse42 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse43)) (.cse44 (+ v_prenex_1 4)) (.cse45 (+ v_prenex_3 4))) (or (< v_prenex_1 0) (= (select .cse41 (select (select .cse42 (select .cse43 .cse3)) .cse44)) 1) (= (select .cse41 (select (select .cse42 (select (select .cse42 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse45)) .cse44)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 .cse45))))))) (not (= (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1821 Int)) (let ((.cse46 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse46 (select (let ((.cse47 (let ((.cse48 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4)) (.cse49 (select v_arrayElimArr_4 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (store .cse48 .cse49 (store (select .cse48 .cse49) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4))) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0))) (not (= (select .cse46 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_ArrVal_1821 Int)) (let ((.cse50 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (not (= (select .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= 1 (select .cse50 (select (let ((.cse51 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse51) (select .cse51 .cse3))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4)))) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (select v_arrayElimArr_4 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_13| |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 0)))))))) (or .cse35 (forall ((v_prenex_6 Int) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1821 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821) (select (let ((.cse52 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse52) (select .cse52 .cse3))) (+ v_prenex_4 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (< v_prenex_5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (select v_arrayElimArr_5 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< v_prenex_4 0)))) (or (forall ((v_prenex_6 Int) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1821 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821) (select (let ((.cse53 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53) (select .cse53 .cse3))) (+ v_prenex_4 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (not (= (select v_arrayElimArr_5 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< v_prenex_4 0))) .cse35) (or (forall ((v_prenex_6 Int) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int) (v_ArrVal_1821 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821) (select (let ((.cse54 (let ((.cse55 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_5)) (.cse56 (select v_arrayElimArr_5 (+ v_prenex_6 4)))) (store .cse55 .cse56 (store (select .cse55 .cse56) (+ 8 v_prenex_5) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))))) (select .cse54 (select (select .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (+ v_prenex_4 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (< v_prenex_5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< v_prenex_4 0))) .cse35) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_ArrVal_1821 Int)) (let ((.cse57 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_7 Int) (v_arrayElimArr_2 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse58 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2)) (.cse61 (+ v_prenex_9 4))) (let ((.cse59 (let ((.cse62 (select v_arrayElimArr_2 .cse61))) (store .cse58 .cse62 (store (select .cse58 .cse62) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)))) (.cse60 (+ v_prenex_7 4))) (or (= (select .cse57 (select (select .cse58 (select (select .cse59 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) .cse60)) 1) (= (select .cse57 (select (select .cse58 (select (select .cse59 |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse61)) .cse60)) 1) (< v_prenex_8 v_prenex_7) (< v_prenex_7 0))))) (not (= (select .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_ArrVal_1821 Int)) (let ((.cse63 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 Int)) (or (< v_prenex_1 0) (= (select .cse63 (select (let ((.cse64 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_2) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse64) (select .cse64 .cse3))) (+ v_prenex_1 4))) 1) (< v_prenex_2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_3 (+ v_prenex_3 4)))))) (not (= (select .cse63 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (forall ((v_ArrVal_1821 Int)) (let ((.cse65 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_ArrVal_1821))) (or (not (= (select .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)) (forall ((v_prenex_7 Int) (v_arrayElimArr_2 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse67 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse68 (store (select .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse66 (+ v_prenex_9 4)) (.cse69 (+ v_prenex_7 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_2 .cse66))) (= (select .cse65 (select (select .cse67 (select .cse68 .cse3)) .cse69)) 1) (= (select .cse65 (select (select .cse67 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse68) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse66)) .cse69)) 1) (< v_prenex_8 v_prenex_7) (< v_prenex_7 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)))))) (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (or (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (and (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_2 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse71 (+ v_prenex_9 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_2 .cse71))) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| 1) (select (let ((.cse72 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (select .cse72 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse72 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse71))) (+ v_prenex_7 4))) 1) (< v_prenex_8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7) (< v_prenex_7 0)))))) (or (not (= .cse70 0)) (let ((.cse73 (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1))) (and (forall ((v_arrayElimCell_46 Int)) (= (select .cse73 v_arrayElimCell_46) 1)) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1820 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse74 (+ v_prenex_1 4))) (or (< v_prenex_1 0) (< v_prenex_2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (select v_arrayElimArr_7 (+ 8 v_prenex_2)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse73 (select v_arrayElimArr_7 .cse74)) 1) (= (select .cse73 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_7) (select v_arrayElimArr_7 .cse3)) .cse74)) 1))))))) (forall ((v_ArrVal_1819 Int) (v_ArrVal_1820 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) 0)) (forall ((v_prenex_8 Int)) (or (< v_prenex_8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (forall ((v_prenex_7 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse76 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2))) (let ((.cse75 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_22| 1)) (.cse77 (store (select .cse76 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 v_prenex_8) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|)) (.cse79 (+ v_prenex_9 4)) (.cse78 (+ v_prenex_7 4))) (or (= (select .cse75 (select (select .cse76 (select .cse77 .cse3)) .cse78)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_2 .cse79))) (= (select .cse75 (select (select .cse76 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820) |v_ULTIMATE.start_node_create_~temp~0#1.base_22| v_arrayElimArr_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse77) |v_ULTIMATE.start_node_create_~temp~0#1.base_22|) .cse79)) .cse78)) 1))))) (< v_prenex_7 0))))))))))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2024-11-13 13:09:49,326 INFO L349 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size [2024-11-13 13:09:49,327 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1594 treesize of output 1011 [2024-11-13 13:09:49,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:09:49,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1815 treesize of output 1844 [2024-11-13 13:09:49,528 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:09:49,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:09:49,567 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 2252 treesize of output 2092 [2024-11-13 13:09:49,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:09:49,774 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 2130 treesize of output 2042 [2024-11-13 13:09:50,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:09:51,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:09:51,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:09:51,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:09:51,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:09: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 8 treesize of output 4 [2024-11-13 13:09:52,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:11:44,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:11:44,713 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 4589 treesize of output 4145 [2024-11-13 13:11:56,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:11:56,294 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 2 case distinctions, treesize of input 101 treesize of output 77 [2024-11-13 13:11:56,765 INFO L349 Elim1Store]: treesize reduction 236, result has 45.7 percent of original size [2024-11-13 13:11:56,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 131264 treesize of output 118617 [2024-11-13 13:11:58,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:11:58,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:11:58,371 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 9401 treesize of output 7481 [2024-11-13 13:11:58,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:11:58,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:11:58,671 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 7184 treesize of output 6780 [2024-11-13 13:12:11,774 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 6719 treesize of output 6687 [2024-11-13 13:12:23,728 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 13:12:23,934 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 12 treesize of output 8 [2024-11-13 13:12:24,268 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 12 treesize of output 8 [2024-11-13 13:12:24,369 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 12 treesize of output 8 [2024-11-13 13:12:24,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:24,415 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 215 treesize of output 211 [2024-11-13 13:12:28,486 INFO L349 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size [2024-11-13 13:12:28,487 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1594 treesize of output 1011 [2024-11-13 13:12:28,506 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:12:28,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:28,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 865 treesize of output 856 [2024-11-13 13:12:28,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:28,587 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 1069 treesize of output 989 [2024-11-13 13:12:28,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:28,637 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 317 treesize of output 313 [2024-11-13 13:12:28,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:12:28,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:12:28,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:12:57,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:12:57,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 8453 treesize of output 7593 [2024-11-13 13:13:11,711 INFO L349 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size [2024-11-13 13:13:11,711 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1594 treesize of output 1011 [2024-11-13 13:13:11,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:11,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3755 treesize of output 3700 [2024-11-13 13:13:11,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:11,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:11,919 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 1748 treesize of output 1664 [2024-11-13 13:13:11,945 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:11,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:11,984 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 1613 treesize of output 1461 [2024-11-13 13:13:12,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:13:12,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:13:12,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:13:13,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:13:13,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:13:13,183 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 13:13:13,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:13:22,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:22,332 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 1537 treesize of output 1489 [2024-11-13 13:13:36,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:36,630 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 2 case distinctions, treesize of input 203 treesize of output 133 [2024-11-13 13:13:36,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:37,492 INFO L349 Elim1Store]: treesize reduction 475, result has 48.4 percent of original size [2024-11-13 13:13:37,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 14 new quantified variables, introduced 55 case distinctions, treesize of input 20461 treesize of output 19368 [2024-11-13 13:13:38,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:38,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:38,182 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 5793 treesize of output 4381 [2024-11-13 13:13:38,431 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:38,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:38,498 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 4057 treesize of output 3805 [2024-11-13 13:13:44,711 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 3374 treesize of output 3358 [2024-11-13 13:13:52,741 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 194 treesize of output 186 [2024-11-13 13:13:53,378 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 203 treesize of output 195 [2024-11-13 13:13:53,820 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 203 treesize of output 195 [2024-11-13 13:13:54,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 142 treesize of output 134 [2024-11-13 13:13:55,078 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 12 treesize of output 8 [2024-11-13 13:13:55,336 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 12 treesize of output 8 [2024-11-13 13:13:56,315 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 12 treesize of output 8 [2024-11-13 13:13:58,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:13:59,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:59,250 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 92 treesize of output 92 [2024-11-13 13:13:59,605 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 20 treesize of output 12 [2024-11-13 13:14:00,358 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 12 treesize of output 8 [2024-11-13 13:14:00,599 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 12 treesize of output 8 [2024-11-13 13:14:01,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:01,158 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 721 treesize of output 669 [2024-11-13 13:14:07,955 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 12 treesize of output 8 [2024-11-13 13:14:07,979 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 127 treesize of output 115 [2024-11-13 13:14:08,266 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 12 treesize of output 8 [2024-11-13 13:14:08,370 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 78 [2024-11-13 13:14:08,574 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 12 treesize of output 8 [2024-11-13 13:14:08,733 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 129 treesize of output 117 [2024-11-13 13:14:08,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:08,981 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 111 treesize of output 95 [2024-11-13 13:14:09,223 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 12 treesize of output 8 [2024-11-13 13:14:09,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:09,339 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 146 treesize of output 126 [2024-11-13 13:14:10,047 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 12 treesize of output 8 [2024-11-13 13:14:10,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:10,078 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 134 treesize of output 110 [2024-11-13 13:14:10,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 52 treesize of output 44 [2024-11-13 13:14:10,407 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 12 treesize of output 8 [2024-11-13 13:14:10,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:10,489 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 150 treesize of output 122 [2024-11-13 13:14:11,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:11,173 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 680 treesize of output 664