./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1 --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 06:38:57,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 06:38:57,662 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 06:38:57,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 06:38:57,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 06:38:57,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 06:38:57,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 06:38:57,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 06:38:57,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 06:38:57,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 06:38:57,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 06:38:57,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 06:38:57,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 06:38:57,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 06:38:57,688 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 06:38:57,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 06:38:57,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 06:38:57,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 06:38:57,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 06:38:57,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 06:38:57,688 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 06:38:57,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:38:57,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:38:57,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:38:57,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 06:38:57,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 06:38:57,690 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_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2024-12-02 06:38:57,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 06:38:57,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 06:38:57,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 06:38:57,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 06:38:57,912 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 06:38:57,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-12-02 06:39:00,668 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/data/3a6a0ae87/cfa7a349ccea4030b963a8f562c0f2fb/FLAGeefce16f9 [2024-12-02 06:39:00,974 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 06:39:00,974 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-12-02 06:39:00,985 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/data/3a6a0ae87/cfa7a349ccea4030b963a8f562c0f2fb/FLAGeefce16f9 [2024-12-02 06:39:01,266 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/data/3a6a0ae87/cfa7a349ccea4030b963a8f562c0f2fb [2024-12-02 06:39:01,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 06:39:01,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 06:39:01,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 06:39:01,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 06:39:01,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 06:39:01,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a349fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01, skipping insertion in model container [2024-12-02 06:39:01,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 06:39:01,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:39:01,584 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 06:39:01,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:39:01,658 INFO L204 MainTranslator]: Completed translation [2024-12-02 06:39:01,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01 WrapperNode [2024-12-02 06:39:01,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 06:39:01,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 06:39:01,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 06:39:01,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 06:39:01,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,701 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 121 [2024-12-02 06:39:01,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 06:39:01,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 06:39:01,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 06:39:01,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 06:39:01,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,730 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-12-02 06:39:01,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 06:39:01,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 06:39:01,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 06:39:01,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 06:39:01,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (1/1) ... [2024-12-02 06:39:01,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:39:01,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:01,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 06:39:01,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 06:39:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 06:39:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 06:39:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 06:39:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 06:39:01,906 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 06:39:01,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 06:39:02,132 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-12-02 06:39:02,132 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 06:39:02,139 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 06:39:02,140 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-12-02 06:39:02,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:39:02 BoogieIcfgContainer [2024-12-02 06:39:02,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 06:39:02,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 06:39:02,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 06:39:02,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 06:39:02,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:39:01" (1/3) ... [2024-12-02 06:39:02,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777bfe14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:39:02, skipping insertion in model container [2024-12-02 06:39:02,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:01" (2/3) ... [2024-12-02 06:39:02,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777bfe14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:39:02, skipping insertion in model container [2024-12-02 06:39:02,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:39:02" (3/3) ... [2024-12-02 06:39:02,150 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2024-12-02 06:39:02,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 06:39:02,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all_reverse.i that has 1 procedures, 67 locations, 1 initial locations, 6 loop locations, and 21 error locations. [2024-12-02 06:39:02,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 06:39:02,217 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;@a1bc3dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 06:39:02,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-12-02 06:39:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 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-12-02 06:39:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 06:39:02,227 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:02,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 06:39:02,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 889601162, now seen corresponding path program 1 times [2024-12-02 06:39:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697440768] [2024-12-02 06:39:02,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:02,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:02,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:02,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697440768] [2024-12-02 06:39:02,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697440768] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:02,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:02,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:39:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514445600] [2024-12-02 06:39:02,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:02,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:39:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:02,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:39:02,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:39:02,457 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-12-02 06:39:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:02,529 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-12-02 06:39:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:39:02,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-12-02 06:39:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:02,539 INFO L225 Difference]: With dead ends: 64 [2024-12-02 06:39:02,539 INFO L226 Difference]: Without dead ends: 61 [2024-12-02 06:39:02,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:39:02,543 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:02,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:39:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-12-02 06:39:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-12-02 06:39:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-12-02 06:39:02,574 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 6 [2024-12-02 06:39:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:02,574 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-12-02 06:39:02,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-12-02 06:39:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-12-02 06:39:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 06:39:02,575 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:02,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 06:39:02,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 06:39:02,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash 889601163, now seen corresponding path program 1 times [2024-12-02 06:39:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928162478] [2024-12-02 06:39:02,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:02,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:02,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928162478] [2024-12-02 06:39:02,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928162478] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:02,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:02,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:39:02,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217947472] [2024-12-02 06:39:02,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:02,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:39:02,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:02,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:39:02,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:39:02,712 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-12-02 06:39:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:02,756 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-12-02 06:39:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:39:02,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-12-02 06:39:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:02,757 INFO L225 Difference]: With dead ends: 59 [2024-12-02 06:39:02,758 INFO L226 Difference]: Without dead ends: 59 [2024-12-02 06:39:02,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:39:02,758 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:02,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-12-02 06:39:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-12-02 06:39:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 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-12-02 06:39:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-12-02 06:39:02,763 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 6 [2024-12-02 06:39:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:02,764 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-12-02 06:39:02,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-12-02 06:39:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-12-02 06:39:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-02 06:39:02,764 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:02,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:02,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 06:39:02,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:02,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash 346343986, now seen corresponding path program 1 times [2024-12-02 06:39:02,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:02,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159125370] [2024-12-02 06:39:02,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:02,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:02,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:02,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159125370] [2024-12-02 06:39:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159125370] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:02,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:02,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:39:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231919578] [2024-12-02 06:39:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:02,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:39:02,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:02,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:39:02,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:39:02,819 INFO L87 Difference]: Start difference. First operand 59 states and 64 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-12-02 06:39:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:02,835 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-12-02 06:39:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:39:02,836 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-12-02 06:39:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:02,837 INFO L225 Difference]: With dead ends: 70 [2024-12-02 06:39:02,837 INFO L226 Difference]: Without dead ends: 70 [2024-12-02 06:39:02,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:39:02,838 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 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-12-02 06:39:02,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-12-02 06:39:02,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-12-02 06:39:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 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-12-02 06:39:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-12-02 06:39:02,844 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 9 [2024-12-02 06:39:02,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:02,845 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-12-02 06:39:02,845 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-12-02 06:39:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-12-02 06:39:02,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 06:39:02,845 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:02,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:02,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 06:39:02,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:02,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1759663698, now seen corresponding path program 1 times [2024-12-02 06:39:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153420008] [2024-12-02 06:39:02,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:02,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:02,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:02,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153420008] [2024-12-02 06:39:02,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153420008] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:02,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:02,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:39:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855477284] [2024-12-02 06:39:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:02,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:39:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:02,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:39:02,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:39:02,941 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:03,035 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-12-02 06:39:03,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:39:03,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-12-02 06:39:03,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:03,037 INFO L225 Difference]: With dead ends: 59 [2024-12-02 06:39:03,037 INFO L226 Difference]: Without dead ends: 59 [2024-12-02 06:39:03,037 INFO L434 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-12-02 06:39:03,037 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:03,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:39:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-12-02 06:39:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-12-02 06:39:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 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-12-02 06:39:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-12-02 06:39:03,041 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 10 [2024-12-02 06:39:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:03,042 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-12-02 06:39:03,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-12-02 06:39:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 06:39:03,042 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:03,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:03,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 06:39:03,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:03,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1759663697, now seen corresponding path program 1 times [2024-12-02 06:39:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:03,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396113851] [2024-12-02 06:39:03,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:03,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:03,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:03,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396113851] [2024-12-02 06:39:03,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396113851] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:03,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:03,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:39:03,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156985431] [2024-12-02 06:39:03,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:03,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:39:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:03,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:39:03,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:39:03,168 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:03,251 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-12-02 06:39:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:39:03,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-12-02 06:39:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:03,252 INFO L225 Difference]: With dead ends: 58 [2024-12-02 06:39:03,252 INFO L226 Difference]: Without dead ends: 58 [2024-12-02 06:39:03,253 INFO L434 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-12-02 06:39:03,253 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:03,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:39:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-12-02 06:39:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-12-02 06:39:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-02 06:39:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-12-02 06:39:03,257 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 10 [2024-12-02 06:39:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:03,257 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-12-02 06:39:03,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-12-02 06:39:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 06:39:03,258 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:03,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:03,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 06:39:03,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:03,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:03,259 INFO L85 PathProgramCache]: Analyzing trace with hash -698202142, now seen corresponding path program 1 times [2024-12-02 06:39:03,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:03,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435841042] [2024-12-02 06:39:03,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:03,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:03,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435841042] [2024-12-02 06:39:03,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435841042] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:03,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182508898] [2024-12-02 06:39:03,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:03,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:03,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:03,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:03,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 06:39:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:03,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 06:39:03,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:03,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182508898] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:03,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-12-02 06:39:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228623790] [2024-12-02 06:39:03,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:03,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:39:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:03,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:39:03,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:39:03,527 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-02 06:39:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:03,541 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-12-02 06:39:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 06:39:03,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 18 [2024-12-02 06:39:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:03,543 INFO L225 Difference]: With dead ends: 67 [2024-12-02 06:39:03,543 INFO L226 Difference]: Without dead ends: 67 [2024-12-02 06:39:03,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-12-02 06:39:03,544 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 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-12-02 06:39:03,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-12-02 06:39:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-12-02 06:39:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-12-02 06:39:03,548 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 18 [2024-12-02 06:39:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:03,548 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-12-02 06:39:03,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-02 06:39:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-12-02 06:39:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-02 06:39:03,549 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:03,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:03,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 06:39:03,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:03,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:03,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2013319118, now seen corresponding path program 2 times [2024-12-02 06:39:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:03,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142265975] [2024-12-02 06:39:03,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:39:03,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:03,780 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 06:39:03,780 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:39:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 06:39:03,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:03,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142265975] [2024-12-02 06:39:03,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142265975] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:03,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:03,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 06:39:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726917254] [2024-12-02 06:39:03,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:03,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 06:39:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:03,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 06:39:03,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 06:39:03,934 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-02 06:39:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:04,141 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-12-02 06:39:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 06:39:04,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-02 06:39:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:04,142 INFO L225 Difference]: With dead ends: 70 [2024-12-02 06:39:04,142 INFO L226 Difference]: Without dead ends: 70 [2024-12-02 06:39:04,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-12-02 06:39:04,143 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:04,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 247 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:39:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-12-02 06:39:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-12-02 06:39:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 69 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-12-02 06:39:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-12-02 06:39:04,147 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 27 [2024-12-02 06:39:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:04,147 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-12-02 06:39:04,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-02 06:39:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-12-02 06:39:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-02 06:39:04,148 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:04,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:04,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 06:39:04,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:04,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2013319117, now seen corresponding path program 1 times [2024-12-02 06:39:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:04,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427045991] [2024-12-02 06:39:04,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:04,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:39:04,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:04,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427045991] [2024-12-02 06:39:04,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427045991] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:04,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:04,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 06:39:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501576097] [2024-12-02 06:39:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:04,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 06:39:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:04,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 06:39:04,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:39:04,421 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-02 06:39:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:04,627 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-12-02 06:39:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 06:39:04,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-02 06:39:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:04,628 INFO L225 Difference]: With dead ends: 70 [2024-12-02 06:39:04,628 INFO L226 Difference]: Without dead ends: 70 [2024-12-02 06:39:04,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-12-02 06:39:04,629 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 43 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:04,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 331 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:39:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-12-02 06:39:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-12-02 06:39:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 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-12-02 06:39:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-12-02 06:39:04,634 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 27 [2024-12-02 06:39:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:04,634 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-12-02 06:39:04,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-02 06:39:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-12-02 06:39:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-02 06:39:04,636 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:04,636 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:04,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 06:39:04,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1983181814, now seen corresponding path program 1 times [2024-12-02 06:39:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422266796] [2024-12-02 06:39:04,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 06:39:04,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:04,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422266796] [2024-12-02 06:39:04,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422266796] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:04,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:04,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:39:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60134902] [2024-12-02 06:39:04,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:04,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 06:39:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:04,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 06:39:04,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 06:39:04,736 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:04,763 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-12-02 06:39:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 06:39:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-12-02 06:39:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:04,764 INFO L225 Difference]: With dead ends: 101 [2024-12-02 06:39:04,764 INFO L226 Difference]: Without dead ends: 101 [2024-12-02 06:39:04,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:39:04,765 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 107 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:04,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-12-02 06:39:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2024-12-02 06:39:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 71 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-12-02 06:39:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-12-02 06:39:04,770 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 29 [2024-12-02 06:39:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:04,770 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-12-02 06:39:04,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-12-02 06:39:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-02 06:39:04,770 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:04,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:04,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 06:39:04,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:04,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:04,771 INFO L85 PathProgramCache]: Analyzing trace with hash 428474865, now seen corresponding path program 1 times [2024-12-02 06:39:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:04,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181569875] [2024-12-02 06:39:04,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 06:39:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:04,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181569875] [2024-12-02 06:39:04,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181569875] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:04,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816141060] [2024-12-02 06:39:04,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:04,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:04,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:04,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:04,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 06:39:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:05,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 06:39:05,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 06:39:05,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 06:39:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816141060] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 06:39:05,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2024-12-02 06:39:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897062389] [2024-12-02 06:39:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:05,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:39:05,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:05,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:39:05,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:39:05,102 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:05,148 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-12-02 06:39:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:39:05,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-12-02 06:39:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:05,149 INFO L225 Difference]: With dead ends: 69 [2024-12-02 06:39:05,149 INFO L226 Difference]: Without dead ends: 69 [2024-12-02 06:39:05,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:39:05,150 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 72 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:05,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 122 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-12-02 06:39:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-12-02 06:39:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 68 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-12-02 06:39:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-12-02 06:39:05,154 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 30 [2024-12-02 06:39:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:05,154 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-12-02 06:39:05,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-12-02 06:39:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-02 06:39:05,155 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:05,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:05,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 06:39:05,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-12-02 06:39:05,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:05,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash 428474934, now seen corresponding path program 1 times [2024-12-02 06:39:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:05,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899939513] [2024-12-02 06:39:05,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899939513] [2024-12-02 06:39:05,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899939513] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435351264] [2024-12-02 06:39:05,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:05,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:05,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:05,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:06,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 06:39:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:06,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-02 06:39:06,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:06,156 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-12-02 06:39:06,157 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-12-02 06:39:06,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:39:06,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:39:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:06,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:06,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435351264] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:06,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:06,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 32 [2024-12-02 06:39:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255845352] [2024-12-02 06:39:06,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 06:39:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:06,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 06:39:06,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2024-12-02 06:39:06,764 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:07,381 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-12-02 06:39:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 06:39:07,382 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-12-02 06:39:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:07,384 INFO L225 Difference]: With dead ends: 80 [2024-12-02 06:39:07,384 INFO L226 Difference]: Without dead ends: 80 [2024-12-02 06:39:07,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 06:39:07,385 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:07,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 716 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 06:39:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-12-02 06:39:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-12-02 06:39:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 74 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-12-02 06:39:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2024-12-02 06:39:07,389 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2024-12-02 06:39:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:07,389 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2024-12-02 06:39:07,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-12-02 06:39:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-02 06:39:07,390 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:07,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:07,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 06:39:07,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:07,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:07,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash 428474935, now seen corresponding path program 1 times [2024-12-02 06:39:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:07,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867140887] [2024-12-02 06:39:07,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867140887] [2024-12-02 06:39:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867140887] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944499658] [2024-12-02 06:39:08,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:08,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:08,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:08,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:08,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 06:39:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:08,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-12-02 06:39:08,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:08,414 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-12-02 06:39:08,524 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:39:08,524 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-12-02 06:39:08,540 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-12-02 06:39:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:39:08,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 06:39:08,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:39:08,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 06:39:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:08,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:09,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:09,496 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 37 treesize of output 55 [2024-12-02 06:39:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944499658] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:09,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 40 [2024-12-02 06:39:09,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17752093] [2024-12-02 06:39:09,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:09,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-12-02 06:39:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:09,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-12-02 06:39:09,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1528, Unknown=0, NotChecked=0, Total=1640 [2024-12-02 06:39:09,654 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 41 states, 40 states have (on average 1.975) internal successors, (79), 41 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-12-02 06:39:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:10,728 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-12-02 06:39:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 06:39:10,729 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.975) internal successors, (79), 41 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) Word has length 30 [2024-12-02 06:39:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:10,729 INFO L225 Difference]: With dead ends: 81 [2024-12-02 06:39:10,729 INFO L226 Difference]: Without dead ends: 81 [2024-12-02 06:39:10,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=243, Invalid=2619, Unknown=0, NotChecked=0, Total=2862 [2024-12-02 06:39:10,731 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 76 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:10,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 899 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 06:39:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-12-02 06:39:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2024-12-02 06:39:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 72 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-12-02 06:39:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-12-02 06:39:10,735 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 30 [2024-12-02 06:39:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:10,735 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-12-02 06:39:10,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.975) internal successors, (79), 41 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-12-02 06:39:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-12-02 06:39:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-02 06:39:10,736 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:10,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:10,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 06:39:10,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:10,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:10,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash -99859533, now seen corresponding path program 1 times [2024-12-02 06:39:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:10,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130676549] [2024-12-02 06:39:10,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 06:39:11,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:11,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130676549] [2024-12-02 06:39:11,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130676549] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:11,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 06:39:11,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489329508] [2024-12-02 06:39:11,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:11,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 06:39:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:11,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 06:39:11,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 06:39:11,057 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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-12-02 06:39:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:11,222 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-12-02 06:39:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 06:39:11,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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 34 [2024-12-02 06:39:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:11,223 INFO L225 Difference]: With dead ends: 76 [2024-12-02 06:39:11,223 INFO L226 Difference]: Without dead ends: 76 [2024-12-02 06:39:11,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-12-02 06:39:11,223 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:11,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 233 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:39:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-12-02 06:39:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-12-02 06:39:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.328125) internal successors, (85), 75 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-12-02 06:39:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-12-02 06:39:11,227 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 34 [2024-12-02 06:39:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:11,227 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-12-02 06:39:11,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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-12-02 06:39:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-12-02 06:39:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-02 06:39:11,228 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:11,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:11,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 06:39:11,228 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:11,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash -99859532, now seen corresponding path program 1 times [2024-12-02 06:39:11,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:11,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423968463] [2024-12-02 06:39:11,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 06:39:11,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:11,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423968463] [2024-12-02 06:39:11,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423968463] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:11,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640323654] [2024-12-02 06:39:11,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:11,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:11,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:11,311 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:11,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 06:39:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:11,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 06:39:11,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 06:39:11,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 06:39:11,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640323654] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 06:39:11,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-12-02 06:39:11,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300096136] [2024-12-02 06:39:11,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:11,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:39:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:11,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:39:11,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:39:11,474 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-02 06:39:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:11,516 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2024-12-02 06:39:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:39:11,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 34 [2024-12-02 06:39:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:11,517 INFO L225 Difference]: With dead ends: 97 [2024-12-02 06:39:11,517 INFO L226 Difference]: Without dead ends: 97 [2024-12-02 06:39:11,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:39:11,518 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 98 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:11,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 144 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-12-02 06:39:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2024-12-02 06:39:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.3125) internal successors, (84), 75 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-12-02 06:39:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-12-02 06:39:11,520 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 34 [2024-12-02 06:39:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:11,520 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-12-02 06:39:11,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-02 06:39:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-12-02 06:39:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 06:39:11,521 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:11,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:11,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 06:39:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-12-02 06:39:11,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -807088875, now seen corresponding path program 1 times [2024-12-02 06:39:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481305825] [2024-12-02 06:39:11,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:11,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:39:11,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481305825] [2024-12-02 06:39:11,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481305825] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590527791] [2024-12-02 06:39:11,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:11,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:11,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:11,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:11,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 06:39:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:11,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 06:39:11,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 06:39:12,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 06:39:12,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590527791] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:12,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:12,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2024-12-02 06:39:12,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621676621] [2024-12-02 06:39:12,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:12,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:39:12,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:12,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:39:12,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:39:12,091 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-02 06:39:12,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:12,139 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2024-12-02 06:39:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:39:12,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-12-02 06:39:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:12,140 INFO L225 Difference]: With dead ends: 99 [2024-12-02 06:39:12,140 INFO L226 Difference]: Without dead ends: 99 [2024-12-02 06:39:12,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-12-02 06:39:12,141 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 116 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:12,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 168 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-12-02 06:39:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2024-12-02 06:39:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 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-12-02 06:39:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-12-02 06:39:12,145 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 37 [2024-12-02 06:39:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:12,146 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-12-02 06:39:12,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-02 06:39:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-12-02 06:39:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 06:39:12,146 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:12,146 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:12,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-12-02 06:39:12,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-12-02 06:39:12,347 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:12,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1764548337, now seen corresponding path program 1 times [2024-12-02 06:39:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514398122] [2024-12-02 06:39:12,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 06:39:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:12,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514398122] [2024-12-02 06:39:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514398122] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:12,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667673749] [2024-12-02 06:39:12,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:12,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:12,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:12,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:12,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 06:39:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:12,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 06:39:12,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 06:39:12,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 06:39:12,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667673749] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:12,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:12,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-12-02 06:39:12,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961899937] [2024-12-02 06:39:12,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:12,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 06:39:12,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:12,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 06:39:12,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 06:39:12,747 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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-12-02 06:39:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:12,809 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-12-02 06:39:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:39:12,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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 38 [2024-12-02 06:39:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:12,811 INFO L225 Difference]: With dead ends: 94 [2024-12-02 06:39:12,811 INFO L226 Difference]: Without dead ends: 94 [2024-12-02 06:39:12,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-12-02 06:39:12,812 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 173 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:12,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 243 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-12-02 06:39:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2024-12-02 06:39:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.36) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 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-12-02 06:39:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-12-02 06:39:12,815 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 38 [2024-12-02 06:39:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:12,816 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-12-02 06:39:12,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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-12-02 06:39:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-12-02 06:39:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 06:39:12,817 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:12,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:12,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 06:39:13,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 06:39:13,018 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:13,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:13,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1569213965, now seen corresponding path program 2 times [2024-12-02 06:39:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:13,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362171809] [2024-12-02 06:39:13,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:39:13,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:13,046 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 06:39:13,046 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:39:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 06:39:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362171809] [2024-12-02 06:39:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362171809] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:13,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 06:39:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143414863] [2024-12-02 06:39:13,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:13,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 06:39:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:13,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 06:39:13,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:39:13,311 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 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-12-02 06:39:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:13,491 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-12-02 06:39:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 06:39:13,492 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 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 42 [2024-12-02 06:39:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:13,492 INFO L225 Difference]: With dead ends: 86 [2024-12-02 06:39:13,492 INFO L226 Difference]: Without dead ends: 86 [2024-12-02 06:39:13,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-12-02 06:39:13,493 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:13,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 279 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:39:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-12-02 06:39:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-12-02 06:39:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 85 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-12-02 06:39:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-12-02 06:39:13,497 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 42 [2024-12-02 06:39:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:13,497 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-12-02 06:39:13,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 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-12-02 06:39:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-12-02 06:39:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-02 06:39:13,498 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:13,498 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:13,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 06:39:13,498 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:13,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2029217178, now seen corresponding path program 1 times [2024-12-02 06:39:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:13,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686891068] [2024-12-02 06:39:13,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 06:39:13,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:13,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686891068] [2024-12-02 06:39:13,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686891068] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:13,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 06:39:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769130951] [2024-12-02 06:39:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:13,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:39:13,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:13,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:39:13,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:39:13,601 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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-12-02 06:39:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:13,649 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-12-02 06:39:13,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:39:13,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 45 [2024-12-02 06:39:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:13,650 INFO L225 Difference]: With dead ends: 82 [2024-12-02 06:39:13,650 INFO L226 Difference]: Without dead ends: 82 [2024-12-02 06:39:13,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-12-02 06:39:13,651 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 37 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:13,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 154 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-12-02 06:39:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-12-02 06:39:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 81 states have internal predecessors, (90), 0 states have call successors, (0), 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-12-02 06:39:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-12-02 06:39:13,655 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 45 [2024-12-02 06:39:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:13,656 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-12-02 06:39:13,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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-12-02 06:39:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-12-02 06:39:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-02 06:39:13,656 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:13,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:13,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 06:39:13,657 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2029217247, now seen corresponding path program 1 times [2024-12-02 06:39:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692761128] [2024-12-02 06:39:13,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:39:14,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:14,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692761128] [2024-12-02 06:39:14,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692761128] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224209939] [2024-12-02 06:39:14,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:14,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:14,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:14,709 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:14,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 06:39:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:14,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-12-02 06:39:14,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:14,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:39:14,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 11 treesize of output 11 [2024-12-02 06:39:14,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:39:15,188 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:39:15,188 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 42 treesize of output 41 [2024-12-02 06:39:15,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:15,287 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 37 treesize of output 19 [2024-12-02 06:39:15,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 06:39:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:39:15,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:19,560 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-12-02 06:39:19,560 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 21 treesize of output 20 [2024-12-02 06:39:19,630 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_971) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-12-02 06:39:19,635 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_971) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) .cse0))) is different from false [2024-12-02 06:39:19,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_971 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_971) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-12-02 06:39:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2024-12-02 06:39:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224209939] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:19,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:19,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 43 [2024-12-02 06:39:19,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377621070] [2024-12-02 06:39:19,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:19,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-12-02 06:39:19,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:19,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-12-02 06:39:19,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1516, Unknown=15, NotChecked=240, Total=1892 [2024-12-02 06:39:19,762 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 44 states, 43 states have (on average 2.395348837209302) internal successors, (103), 44 states have internal predecessors, (103), 0 states have call successors, (0), 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-12-02 06:39:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:20,721 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-12-02 06:39:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-12-02 06:39:20,722 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.395348837209302) internal successors, (103), 44 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-12-02 06:39:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:20,722 INFO L225 Difference]: With dead ends: 88 [2024-12-02 06:39:20,722 INFO L226 Difference]: Without dead ends: 88 [2024-12-02 06:39:20,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=247, Invalid=2720, Unknown=15, NotChecked=324, Total=3306 [2024-12-02 06:39:20,723 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 94 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:20,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1080 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1125 Invalid, 0 Unknown, 181 Unchecked, 0.6s Time] [2024-12-02 06:39:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-12-02 06:39:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-12-02 06:39:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2024-12-02 06:39:20,727 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 45 [2024-12-02 06:39:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:20,727 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2024-12-02 06:39:20,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.395348837209302) internal successors, (103), 44 states have internal predecessors, (103), 0 states have call successors, (0), 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-12-02 06:39:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-12-02 06:39:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-02 06:39:20,727 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:20,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:20,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 06:39:20,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:20,928 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:20,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2029217248, now seen corresponding path program 1 times [2024-12-02 06:39:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:20,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88122704] [2024-12-02 06:39:20,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:20,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:39:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88122704] [2024-12-02 06:39:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88122704] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075653445] [2024-12-02 06:39:22,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:22,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:22,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:22,423 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:22,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 06:39:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:22,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-12-02 06:39:22,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:22,724 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:39:22,724 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-12-02 06:39:22,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:39:22,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:39:23,222 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:39:23,222 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 70 treesize of output 65 [2024-12-02 06:39:23,226 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 49 treesize of output 30 [2024-12-02 06:39:23,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:23,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2024-12-02 06:39:23,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:23,392 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 44 treesize of output 26 [2024-12-02 06:39:23,498 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 39 treesize of output 21 [2024-12-02 06:39:23,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-12-02 06:39:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:39:23,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:23,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1084 (Array Int Int))) (or (not (= v_ArrVal_1084 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1084 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_1084 (Array Int Int))) (or (not (= v_ArrVal_1084 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1084 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1082 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1082)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))))) is different from false [2024-12-02 06:39:23,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:23,890 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 46 treesize of output 50 [2024-12-02 06:39:24,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) 1))) (forall ((v_ArrVal_1080 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1080) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1081) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2024-12-02 06:39:24,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1081) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (forall ((v_ArrVal_1080 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1080) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 1)))))) is different from false [2024-12-02 06:39:24,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1080) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1081) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))))) is different from false [2024-12-02 06:39:24,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:24,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-12-02 06:39:24,633 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 40 treesize of output 28 [2024-12-02 06:39:24,644 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-12-02 06:39:24,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2024-12-02 06:39:24,649 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-12-02 06:39:24,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-12-02 06:39:24,813 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-12-02 06:39:24,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-12-02 06:39:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2024-12-02 06:39:24,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075653445] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:24,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:24,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 53 [2024-12-02 06:39:24,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727811955] [2024-12-02 06:39:24,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:24,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-12-02 06:39:24,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:24,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-12-02 06:39:24,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2199, Unknown=88, NotChecked=396, Total=2862 [2024-12-02 06:39:24,892 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 54 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:26,430 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-12-02 06:39:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 06:39:26,431 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-12-02 06:39:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:26,431 INFO L225 Difference]: With dead ends: 87 [2024-12-02 06:39:26,432 INFO L226 Difference]: Without dead ends: 87 [2024-12-02 06:39:26,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=313, Invalid=3392, Unknown=93, NotChecked=492, Total=4290 [2024-12-02 06:39:26,433 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 97 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:26,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1078 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1029 Invalid, 0 Unknown, 232 Unchecked, 0.7s Time] [2024-12-02 06:39:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-12-02 06:39:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2024-12-02 06:39:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 77 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-12-02 06:39:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2024-12-02 06:39:26,436 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 45 [2024-12-02 06:39:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:26,436 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2024-12-02 06:39:26,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2024-12-02 06:39:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-02 06:39:26,437 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:26,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:26,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 06:39:26,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:26,638 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:26,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2068206098, now seen corresponding path program 1 times [2024-12-02 06:39:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:26,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518137210] [2024-12-02 06:39:26,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 06:39:26,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:26,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518137210] [2024-12-02 06:39:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518137210] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:39:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566074443] [2024-12-02 06:39:26,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:26,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:39:26,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:26,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:39:26,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:39:26,760 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-02 06:39:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:26,802 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-12-02 06:39:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:39:26,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 48 [2024-12-02 06:39:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:26,803 INFO L225 Difference]: With dead ends: 82 [2024-12-02 06:39:26,803 INFO L226 Difference]: Without dead ends: 82 [2024-12-02 06:39:26,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-02 06:39:26,804 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:26,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 124 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-12-02 06:39:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-12-02 06:39:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1690140845070423) 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-12-02 06:39:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-12-02 06:39:26,807 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 48 [2024-12-02 06:39:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:26,807 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-12-02 06:39:26,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-02 06:39:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-12-02 06:39:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-02 06:39:26,807 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:26,807 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:26,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 06:39:26,808 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:26,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:26,808 INFO L85 PathProgramCache]: Analyzing trace with hash 561579808, now seen corresponding path program 1 times [2024-12-02 06:39:26,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:26,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989472001] [2024-12-02 06:39:26,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 06:39:28,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:28,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989472001] [2024-12-02 06:39:28,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989472001] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:28,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744929942] [2024-12-02 06:39:28,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:28,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:28,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:28,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:28,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 06:39:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:28,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-12-02 06:39:28,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:28,411 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:39:28,412 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-12-02 06:39:28,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:39:28,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 06:39:29,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 06:39:29,023 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 80 treesize of output 73 [2024-12-02 06:39:29,027 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 29 treesize of output 19 [2024-12-02 06:39:29,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-12-02 06:39:29,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:29,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2024-12-02 06:39:29,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-12-02 06:39:29,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:29,224 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 44 treesize of output 26 [2024-12-02 06:39:29,391 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 39 treesize of output 21 [2024-12-02 06:39:29,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-12-02 06:39:29,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 06:39:29,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:29,524 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 15 treesize of output 10 [2024-12-02 06:39:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 06:39:29,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:30,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:30,525 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 31 treesize of output 32 [2024-12-02 06:39:30,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:30,536 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 65 treesize of output 68 [2024-12-02 06:39:30,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-12-02 06:39:30,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (forall ((v_ArrVal_1243 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse0 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)) (< .cse0 0)))) (or .cse2 (forall ((v_ArrVal_1244 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_main_~s~0#1.base|)))) (or .cse2 (forall ((v_ArrVal_1244 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (or .cse2 (< |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)) (or (= (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) .cse2)))) is different from false [2024-12-02 06:39:31,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (let ((.cse0 (forall ((v_ArrVal_1243 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1243) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) 0))) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (and (or .cse0 (< .cse1 1)) (or .cse0 (forall ((v_ArrVal_1244 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1244) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) .cse2))) (or (forall ((v_ArrVal_1244 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1244) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) .cse0) (forall ((v_ArrVal_1243 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1243) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (or (< .cse4 0) (< .cse4 (+ .cse1 1))))))))) is different from false [2024-12-02 06:39:31,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:31,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-12-02 06:39:31,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-12-02 06:39:31,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:31,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-12-02 06:39:31,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:31,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-12-02 06:39:31,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-12-02 06:39:31,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:31,594 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 18 treesize of output 12 [2024-12-02 06:39:31,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-12-02 06:39:31,603 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-12-02 06:39:31,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-12-02 06:39:31,606 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-12-02 06:39:31,915 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-12-02 06:39:31,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-12-02 06:39:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-12-02 06:39:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744929942] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:32,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 76 [2024-12-02 06:39:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465583994] [2024-12-02 06:39:32,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:32,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-12-02 06:39:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:32,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-12-02 06:39:32,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=5093, Unknown=66, NotChecked=290, Total=5700 [2024-12-02 06:39:32,053 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 76 states, 76 states have (on average 1.8289473684210527) internal successors, (139), 76 states have internal predecessors, (139), 0 states have call successors, (0), 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-12-02 06:39:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:35,064 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-12-02 06:39:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-12-02 06:39:35,065 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.8289473684210527) internal successors, (139), 76 states have internal predecessors, (139), 0 states have call successors, (0), 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 51 [2024-12-02 06:39:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:35,065 INFO L225 Difference]: With dead ends: 85 [2024-12-02 06:39:35,065 INFO L226 Difference]: Without dead ends: 85 [2024-12-02 06:39:35,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2328 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=581, Invalid=8673, Unknown=66, NotChecked=382, Total=9702 [2024-12-02 06:39:35,069 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 96 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:35,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1530 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2162 Invalid, 0 Unknown, 166 Unchecked, 1.4s Time] [2024-12-02 06:39:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-12-02 06:39:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2024-12-02 06:39:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 77 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-12-02 06:39:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-12-02 06:39:35,071 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 51 [2024-12-02 06:39:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:35,071 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-12-02 06:39:35,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.8289473684210527) internal successors, (139), 76 states have internal predecessors, (139), 0 states have call successors, (0), 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-12-02 06:39:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-12-02 06:39:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-02 06:39:35,072 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:35,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:35,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 06:39:35,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:35,273 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:35,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash 590926333, now seen corresponding path program 1 times [2024-12-02 06:39:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372591371] [2024-12-02 06:39:35,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 06:39:35,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:35,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372591371] [2024-12-02 06:39:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372591371] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:35,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465081410] [2024-12-02 06:39:35,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:35,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:35,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:35,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:35,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 06:39:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:35,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-02 06:39:35,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:35,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-12-02 06:39:35,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-12-02 06:39:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 06:39:36,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:36,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-12-02 06:39:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 06:39:36,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465081410] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:36,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:36,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 26 [2024-12-02 06:39:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93809938] [2024-12-02 06:39:36,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:36,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-12-02 06:39:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:36,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-12-02 06:39:36,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-12-02 06:39:36,104 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 0 states have call successors, (0), 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-12-02 06:39:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:36,478 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-12-02 06:39:36,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 06:39:36,478 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 0 states have call successors, (0), 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 58 [2024-12-02 06:39:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:36,478 INFO L225 Difference]: With dead ends: 85 [2024-12-02 06:39:36,479 INFO L226 Difference]: Without dead ends: 85 [2024-12-02 06:39:36,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2024-12-02 06:39:36,479 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 121 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:36,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 731 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 06:39:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-12-02 06:39:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-12-02 06:39:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-12-02 06:39:36,481 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 58 [2024-12-02 06:39:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:36,482 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-12-02 06:39:36,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 0 states have call successors, (0), 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-12-02 06:39:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-12-02 06:39:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-02 06:39:36,482 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:36,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:36,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 06:39:36,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-12-02 06:39:36,682 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:36,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1138936823, now seen corresponding path program 1 times [2024-12-02 06:39:36,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:36,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378246636] [2024-12-02 06:39:36,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:36,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-02 06:39:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:36,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378246636] [2024-12-02 06:39:36,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378246636] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:36,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:36,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 06:39:36,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78299624] [2024-12-02 06:39:36,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:36,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 06:39:36,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:36,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 06:39:36,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 06:39:36,796 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 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-12-02 06:39:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:36,950 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-12-02 06:39:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 06:39:36,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 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 59 [2024-12-02 06:39:36,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:36,951 INFO L225 Difference]: With dead ends: 83 [2024-12-02 06:39:36,951 INFO L226 Difference]: Without dead ends: 83 [2024-12-02 06:39:36,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 06:39:36,952 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:36,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:39:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-12-02 06:39:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-12-02 06:39:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.155844155844156) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-12-02 06:39:36,954 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 59 [2024-12-02 06:39:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:36,955 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-12-02 06:39:36,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 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-12-02 06:39:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-12-02 06:39:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-02 06:39:36,955 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:36,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:36,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 06:39:36,955 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:36,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1138936824, now seen corresponding path program 1 times [2024-12-02 06:39:36,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:36,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498309350] [2024-12-02 06:39:36,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-02 06:39:37,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:37,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498309350] [2024-12-02 06:39:37,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498309350] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:37,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:37,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 06:39:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420173643] [2024-12-02 06:39:37,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:37,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 06:39:37,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:37,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 06:39:37,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:39:37,201 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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-12-02 06:39:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:37,377 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-12-02 06:39:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 06:39:37,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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 59 [2024-12-02 06:39:37,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:37,378 INFO L225 Difference]: With dead ends: 85 [2024-12-02 06:39:37,378 INFO L226 Difference]: Without dead ends: 85 [2024-12-02 06:39:37,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-12-02 06:39:37,378 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:37,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 222 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:39:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-12-02 06:39:37,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-12-02 06:39:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.139240506329114) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 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-12-02 06:39:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-12-02 06:39:37,381 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 59 [2024-12-02 06:39:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:37,381 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-12-02 06:39:37,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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-12-02 06:39:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-12-02 06:39:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-02 06:39:37,382 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:37,382 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:37,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 06:39:37,382 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:37,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 947305589, now seen corresponding path program 1 times [2024-12-02 06:39:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:37,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293955827] [2024-12-02 06:39:37,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:37,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-02 06:39:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293955827] [2024-12-02 06:39:37,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293955827] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 06:39:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399473205] [2024-12-02 06:39:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:37,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 06:39:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:37,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 06:39:37,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 06:39:37,498 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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-12-02 06:39:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:37,614 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-12-02 06:39:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 06:39:37,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 60 [2024-12-02 06:39:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:37,615 INFO L225 Difference]: With dead ends: 87 [2024-12-02 06:39:37,615 INFO L226 Difference]: Without dead ends: 87 [2024-12-02 06:39:37,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 06:39:37,616 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:37,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 266 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:39:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-12-02 06:39:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-12-02 06:39:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-12-02 06:39:37,618 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 60 [2024-12-02 06:39:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:37,618 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-12-02 06:39:37,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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-12-02 06:39:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-12-02 06:39:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 06:39:37,619 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:37,619 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:37,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 06:39:37,619 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:37,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1449982805, now seen corresponding path program 2 times [2024-12-02 06:39:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:37,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565086580] [2024-12-02 06:39:37,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:39:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:37,642 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 06:39:37,642 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:39:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-02 06:39:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565086580] [2024-12-02 06:39:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565086580] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64545429] [2024-12-02 06:39:37,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:39:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:37,739 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:37,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 06:39:37,941 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 06:39:37,941 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:39:37,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 06:39:37,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-02 06:39:38,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-02 06:39:38,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64545429] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:38,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:38,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-12-02 06:39:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648950683] [2024-12-02 06:39:38,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:38,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 06:39:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:38,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 06:39:38,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 06:39:38,072 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-12-02 06:39:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:38,113 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-12-02 06:39:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:39:38,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 06:39:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:38,114 INFO L225 Difference]: With dead ends: 74 [2024-12-02 06:39:38,114 INFO L226 Difference]: Without dead ends: 74 [2024-12-02 06:39:38,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-12-02 06:39:38,114 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 57 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:38,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 128 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:39:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-12-02 06:39:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-12-02 06:39:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-12-02 06:39:38,116 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 61 [2024-12-02 06:39:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:38,116 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-12-02 06:39:38,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-12-02 06:39:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-12-02 06:39:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 06:39:38,116 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:38,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:38,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 06:39:38,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 06:39:38,317 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:38,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash -174648022, now seen corresponding path program 1 times [2024-12-02 06:39:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:38,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780264507] [2024-12-02 06:39:38,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:38,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-02 06:39:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780264507] [2024-12-02 06:39:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780264507] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:39:38,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:39:38,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 06:39:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731389692] [2024-12-02 06:39:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:39:38,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 06:39:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:38,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 06:39:38,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 06:39:38,422 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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-12-02 06:39:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:38,539 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-12-02 06:39:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 06:39:38,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 62 [2024-12-02 06:39:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:38,540 INFO L225 Difference]: With dead ends: 75 [2024-12-02 06:39:38,540 INFO L226 Difference]: Without dead ends: 75 [2024-12-02 06:39:38,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 06:39:38,541 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:38,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 222 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 06:39:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-12-02 06:39:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-12-02 06:39:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) 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-12-02 06:39:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-12-02 06:39:38,542 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2024-12-02 06:39:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:38,542 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-12-02 06:39:38,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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-12-02 06:39:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-12-02 06:39:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 06:39:38,543 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:38,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:38,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 06:39:38,543 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:38,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1733666497, now seen corresponding path program 1 times [2024-12-02 06:39:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:38,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19834275] [2024-12-02 06:39:38,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:38,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-02 06:39:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19834275] [2024-12-02 06:39:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19834275] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818715646] [2024-12-02 06:39:39,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:39,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:39,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:39,406 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:39,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 06:39:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:39,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-12-02 06:39:39,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:39,595 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:39:39,596 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-12-02 06:39:39,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 06:39:39,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 06:39:39,876 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-12-02 06:39:39,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:39,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-12-02 06:39:40,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:40,115 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 27 treesize of output 21 [2024-12-02 06:39:40,240 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-12-02 06:39:40,240 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 18 treesize of output 13 [2024-12-02 06:39:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 06:39:40,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:40,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:40,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2024-12-02 06:39:40,749 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1776 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1776) 4)))) (forall ((v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_4) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_3 v_prenex_5) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_3)))) is different from false [2024-12-02 06:39:41,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1776 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1774) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1776) 4)))) (forall ((v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| v_prenex_3) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_4) |c_ULTIMATE.start_sll_create_#res#1.base|) v_prenex_3 v_prenex_5) 4) |c_ULTIMATE.start_sll_create_#res#1.base|)))))) is different from false [2024-12-02 06:39:41,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_4) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_5) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_prenex_3))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1776 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1774) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1776) 4) .cse0))))) is different from false [2024-12-02 06:39:41,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:41,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-12-02 06:39:41,401 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 38 treesize of output 34 [2024-12-02 06:39:41,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-12-02 06:39:41,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:41,417 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 32 treesize of output 34 [2024-12-02 06:39:41,456 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-12-02 06:39:41,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-12-02 06:39:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 4 not checked. [2024-12-02 06:39:41,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818715646] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:41,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:41,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 51 [2024-12-02 06:39:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082717974] [2024-12-02 06:39:41,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:41,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-12-02 06:39:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:41,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-12-02 06:39:41,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2164, Unknown=20, NotChecked=288, Total=2652 [2024-12-02 06:39:41,538 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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-12-02 06:39:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:42,740 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-12-02 06:39:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-12-02 06:39:42,741 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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 65 [2024-12-02 06:39:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:42,742 INFO L225 Difference]: With dead ends: 85 [2024-12-02 06:39:42,742 INFO L226 Difference]: Without dead ends: 85 [2024-12-02 06:39:42,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=307, Invalid=3589, Unknown=22, NotChecked=372, Total=4290 [2024-12-02 06:39:42,743 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:42,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 736 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1412 Invalid, 0 Unknown, 208 Unchecked, 0.7s Time] [2024-12-02 06:39:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-12-02 06:39:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2024-12-02 06:39:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) 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-12-02 06:39:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-12-02 06:39:42,745 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2024-12-02 06:39:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:42,745 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-12-02 06:39:42,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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-12-02 06:39:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-12-02 06:39:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 06:39:42,746 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:42,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:42,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 06:39:42,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 06:39:42,946 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:42,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1733666496, now seen corresponding path program 1 times [2024-12-02 06:39:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:42,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843210561] [2024-12-02 06:39:42,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 06:39:44,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843210561] [2024-12-02 06:39:44,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843210561] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389443777] [2024-12-02 06:39:44,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:44,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:44,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:44,202 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:44,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 06:39:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:44,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-12-02 06:39:44,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:44,410 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-12-02 06:39:44,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:39:44,516 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-12-02 06:39:44,522 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-12-02 06:39:44,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 06:39:44,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 06:39:44,777 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 06:39:44,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-12-02 06:39:44,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-12-02 06:39:44,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:44,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-12-02 06:39:44,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:44,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-12-02 06:39:45,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:45,240 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 17 treesize of output 15 [2024-12-02 06:39:45,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:45,247 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 27 treesize of output 21 [2024-12-02 06:39:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 06:39:45,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:45,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1890 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1890 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1890)))) (forall ((v_ArrVal_1890 (Array Int Int))) (or (forall ((v_ArrVal_1892 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1892)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1890 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1890)))))) is different from false [2024-12-02 06:39:46,087 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4)))))) is different from false [2024-12-02 06:39:46,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1888) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4) 5)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))))) is different from false [2024-12-02 06:39:46,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_4 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1888) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1892) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_DerPreprocessor_5 Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1889) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_DerPreprocessor_5) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))))) is different from false [2024-12-02 06:39:46,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:46,728 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 25 treesize of output 26 [2024-12-02 06:39:46,730 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 42 treesize of output 38 [2024-12-02 06:39:46,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-12-02 06:39:46,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:46,743 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 36 treesize of output 38 [2024-12-02 06:39:46,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:46,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2024-12-02 06:39:46,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:46,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-12-02 06:39:46,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 06:39:46,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-12-02 06:39:46,787 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 06:39:46,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-12-02 06:39:46,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 06:39:46,794 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 21 treesize of output 17 [2024-12-02 06:39:46,796 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 06:39:46,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-12-02 06:39:47,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:47,139 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 34 treesize of output 52 [2024-12-02 06:39:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 4 not checked. [2024-12-02 06:39:47,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389443777] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:47,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:47,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 57 [2024-12-02 06:39:47,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111638878] [2024-12-02 06:39:47,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:47,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-12-02 06:39:47,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:47,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-12-02 06:39:47,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2590, Unknown=89, NotChecked=428, Total=3306 [2024-12-02 06:39:47,299 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 58 states, 57 states have (on average 2.5789473684210527) internal successors, (147), 58 states have internal predecessors, (147), 0 states have call successors, (0), 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-12-02 06:39:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:48,827 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-12-02 06:39:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-12-02 06:39:48,827 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.5789473684210527) internal successors, (147), 58 states have internal predecessors, (147), 0 states have call successors, (0), 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 65 [2024-12-02 06:39:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:48,827 INFO L225 Difference]: With dead ends: 87 [2024-12-02 06:39:48,827 INFO L226 Difference]: Without dead ends: 87 [2024-12-02 06:39:48,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=330, Invalid=4007, Unknown=101, NotChecked=532, Total=4970 [2024-12-02 06:39:48,828 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 50 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:48,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 767 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1353 Invalid, 0 Unknown, 282 Unchecked, 0.8s Time] [2024-12-02 06:39:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-12-02 06:39:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-12-02 06:39:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 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-12-02 06:39:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-12-02 06:39:48,830 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2024-12-02 06:39:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:48,830 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-12-02 06:39:48,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.5789473684210527) internal successors, (147), 58 states have internal predecessors, (147), 0 states have call successors, (0), 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-12-02 06:39:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-12-02 06:39:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 06:39:48,831 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:48,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:48,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 06:39:49,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:49,031 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:49,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2090915885, now seen corresponding path program 1 times [2024-12-02 06:39:49,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:49,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726153351] [2024-12-02 06:39:49,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:49,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 06:39:49,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726153351] [2024-12-02 06:39:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726153351] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142475005] [2024-12-02 06:39:49,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:49,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:49,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:49,903 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:49,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 06:39:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:50,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-12-02 06:39:50,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:50,219 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:39:50,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 06:39:50,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 06:39:50,622 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 06:39:50,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-12-02 06:39:50,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:50,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-12-02 06:39:50,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:50,813 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 26 treesize of output 20 [2024-12-02 06:39:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 06:39:50,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:51,575 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_75| Int) (v_ArrVal_2002 Int) (v_ArrVal_2000 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2000) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_75| v_ArrVal_2002) 4) 0)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_75|))) is different from false [2024-12-02 06:39:51,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:51,806 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 24 treesize of output 25 [2024-12-02 06:39:51,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-12-02 06:39:51,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:51,819 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 48 treesize of output 50 [2024-12-02 06:39:51,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-12-02 06:39:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 06:39:52,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142475005] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:52,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:52,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 57 [2024-12-02 06:39:52,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838014163] [2024-12-02 06:39:52,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:52,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-12-02 06:39:52,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:52,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-12-02 06:39:52,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2824, Unknown=46, NotChecked=108, Total=3192 [2024-12-02 06:39:52,028 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 57 states, 57 states have (on average 2.56140350877193) internal successors, (146), 57 states have internal predecessors, (146), 0 states have call successors, (0), 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-12-02 06:39:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:53,287 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-12-02 06:39:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-12-02 06:39:53,287 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.56140350877193) internal successors, (146), 57 states have internal predecessors, (146), 0 states have call successors, (0), 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 66 [2024-12-02 06:39:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:53,287 INFO L225 Difference]: With dead ends: 89 [2024-12-02 06:39:53,287 INFO L226 Difference]: Without dead ends: 89 [2024-12-02 06:39:53,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=372, Invalid=4556, Unknown=46, NotChecked=138, Total=5112 [2024-12-02 06:39:53,289 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 52 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:53,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 916 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1310 Invalid, 0 Unknown, 65 Unchecked, 0.7s Time] [2024-12-02 06:39:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-12-02 06:39:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-12-02 06:39:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 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-12-02 06:39:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-12-02 06:39:53,291 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2024-12-02 06:39:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:53,291 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-12-02 06:39:53,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.56140350877193) internal successors, (146), 57 states have internal predecessors, (146), 0 states have call successors, (0), 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-12-02 06:39:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-12-02 06:39:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 06:39:53,291 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:53,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:53,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 06:39:53,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-12-02 06:39:53,492 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:53,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash -676781342, now seen corresponding path program 1 times [2024-12-02 06:39:53,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:53,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954339288] [2024-12-02 06:39:53,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:53,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 06:39:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954339288] [2024-12-02 06:39:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954339288] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20519425] [2024-12-02 06:39:54,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:39:54,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:54,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:54,607 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:54,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 06:39:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:39:54,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-12-02 06:39:54,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:39:54,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:39:54,925 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-12-02 06:39:54,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 06:39:55,158 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 06:39:55,158 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-12-02 06:39:55,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:39:55,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-12-02 06:39:55,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:55,373 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 27 treesize of output 21 [2024-12-02 06:39:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 06:39:55,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:39:55,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2112 Int) (v_ArrVal_2110 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2110) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| v_ArrVal_2112) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|))) is different from false [2024-12-02 06:39:55,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2112 Int) (v_ArrVal_2110 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2110) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| v_ArrVal_2112) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|))) is different from false [2024-12-02 06:39:55,879 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2112 Int) (v_ArrVal_2110 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2110) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| v_ArrVal_2112) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|))) is different from false [2024-12-02 06:39:56,021 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2112 Int) (v_ArrVal_2110 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2110) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| v_ArrVal_2112) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|))) is different from false [2024-12-02 06:39:56,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_82| Int) (v_ArrVal_2112 Int) (v_ArrVal_2110 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2110) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_82| v_ArrVal_2112) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_82|))) is different from false [2024-12-02 06:39:56,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:56,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-12-02 06:39:56,159 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 38 treesize of output 34 [2024-12-02 06:39:56,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:39:56,169 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 36 treesize of output 38 [2024-12-02 06:39:56,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-12-02 06:39:56,347 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-12-02 06:39:56,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-12-02 06:39:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 5 not checked. [2024-12-02 06:39:56,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20519425] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:39:56,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:39:56,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 48 [2024-12-02 06:39:56,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398244997] [2024-12-02 06:39:56,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:39:56,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-12-02 06:39:56,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:39:56,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-12-02 06:39:56,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1718, Unknown=29, NotChecked=440, Total=2352 [2024-12-02 06:39:56,401 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 49 states, 48 states have (on average 2.8125) internal successors, (135), 49 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:39:57,488 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2024-12-02 06:39:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-12-02 06:39:57,489 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.8125) internal successors, (135), 49 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 06:39:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:39:57,489 INFO L225 Difference]: With dead ends: 88 [2024-12-02 06:39:57,489 INFO L226 Difference]: Without dead ends: 88 [2024-12-02 06:39:57,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 110 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=281, Invalid=3015, Unknown=30, NotChecked=580, Total=3906 [2024-12-02 06:39:57,490 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 55 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 06:39:57,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 765 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1194 Invalid, 0 Unknown, 347 Unchecked, 0.6s Time] [2024-12-02 06:39:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-12-02 06:39:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-12-02 06:39:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 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-12-02 06:39:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-12-02 06:39:57,493 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2024-12-02 06:39:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:39:57,493 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-12-02 06:39:57,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.8125) internal successors, (135), 49 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:39:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-12-02 06:39:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 06:39:57,493 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:39:57,493 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:39:57,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 06:39:57,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-12-02 06:39:57,694 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:39:57,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:39:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1416310649, now seen corresponding path program 2 times [2024-12-02 06:39:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:39:57,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446244901] [2024-12-02 06:39:57,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:39:57,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:39:57,722 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 06:39:57,722 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:39:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-02 06:39:59,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:39:59,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446244901] [2024-12-02 06:39:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446244901] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:39:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97385708] [2024-12-02 06:39:59,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:39:59,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:39:59,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:39:59,740 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:39:59,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 06:39:59,952 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 06:39:59,952 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:39:59,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-12-02 06:39:59,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:40:00,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 06:40:00,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 06:40:00,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:40:00,109 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-12-02 06:40:00,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-12-02 06:40:00,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-12-02 06:40:00,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-12-02 06:40:00,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-12-02 06:40:00,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-12-02 06:40:00,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-12-02 06:40:00,772 INFO L349 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2024-12-02 06:40:00,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 96 [2024-12-02 06:40:00,844 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2024-12-02 06:40:00,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 67 [2024-12-02 06:40:01,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 06:40:01,496 INFO L349 Elim1Store]: treesize reduction 104, result has 32.5 percent of original size [2024-12-02 06:40:01,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 134 treesize of output 140 [2024-12-02 06:40:01,543 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-12-02 06:40:01,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 113 [2024-12-02 06:40:01,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-12-02 06:40:01,785 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:40:01,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2024-12-02 06:40:01,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-12-02 06:40:04,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 06:40:05,017 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-12-02 06:40:05,018 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 66 treesize of output 43 [2024-12-02 06:40:05,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:40:05,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-12-02 06:40:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 06:40:05,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:40:05,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-12-02 06:40:06,944 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2229) .cse0) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) (= (select (select .cse5 .cse4) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))))))) is different from false [2024-12-02 06:40:06,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= (select (select .cse0 .cse1) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1))))) (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229)) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2229) .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5))))))) is different from false [2024-12-02 06:40:07,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= (select (select .cse2 .cse0) 4) 0))))) (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2229) .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229)))))))) is different from false [2024-12-02 06:40:07,065 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2229) .cse0) 4) 0) (not (= v_ArrVal_2229 (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= (select (select .cse4 .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))))))) is different from false [2024-12-02 06:40:07,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse10)) (.cse4 (select .cse10 4)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse8 4)) (.cse5 (select .cse3 .cse4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse1 (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= (select (select .cse1 .cse2) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2))))) (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse8)) (.cse7 (select (select (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (not (= v_ArrVal_2229 (store (select .cse6 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))) (= (select (select (store .cse6 .cse4 v_ArrVal_2229) .cse7) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7))))))))) is different from false [2024-12-02 06:40:07,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse10)) (.cse3 (select .cse10 4)) (.cse4 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse4 4)) (.cse6 (select .cse5 .cse3))) (and (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse1 (select (select (store .cse5 .cse3 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_node_create_#res#1.base|) 4)) (.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse1) (= (select (select (store .cse2 .cse3 v_ArrVal_2229) .cse1) 4) 0) (not (= (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse7 (store .cse5 .cse3 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (= (select (select .cse7 .cse8) 4) 0) (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse8)))))))))) is different from false [2024-12-02 06:40:07,168 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse4 (select .cse10 4)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select .cse8 4)) (.cse5 (select .cse3 .cse4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse1 (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse0) (= (select (select .cse1 .cse0) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|))))) (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8)) (.cse6 (select (select (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse6) (not (= (store (select .cse7 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229)) (= (select (select (store .cse7 .cse4 v_ArrVal_2229) .cse6) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|))))))))) is different from false [2024-12-02 06:40:07,199 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-12-02 06:40:07,199 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 118 [2024-12-02 06:40:07,229 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-12-02 06:40:07,229 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 180 [2024-12-02 06:40:07,572 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-12-02 06:40:07,573 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 158 [2024-12-02 06:40:07,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-12-02 06:40:07,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int) (v_arrayElimArr_18 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18)) (.cse4 (select v_arrayElimArr_18 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse1) (= (select (select .cse2 .cse1) 4) 0))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int) (v_arrayElimArr_18 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (= (select (let ((.cse6 (let ((.cse7 (select v_arrayElimArr_18 4))) (store .cse5 .cse7 (store (select .cse5 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_ArrVal_2231 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (let ((.cse12 (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8) (= (select (let ((.cse9 (let ((.cse11 (select v_arrayElimArr_18 4))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse12 .cse8) 4) 0)))))) (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) .cse13) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int) (v_arrayElimArr_18 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (= (select (let ((.cse15 (let ((.cse16 (select v_arrayElimArr_18 4))) (store .cse14 .cse16 (store (select .cse14 .cse16) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) .cse13) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_ArrVal_2231 Int)) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (let ((.cse21 (store .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231)))) (let ((.cse17 (select (select .cse21 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse17) (= (select (let ((.cse18 (let ((.cse20 (select v_arrayElimArr_18 4))) (store .cse19 .cse20 (store (select .cse19 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse21 .cse17) 4) 0)))))) (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|))) (or (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int))) (let ((.cse23 (select v_arrayElimArr_17 4))) (let ((.cse22 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse24 (select (select (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (store .cse25 .cse23 (store (select .cse25 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse22 .cse23 v_ArrVal_2229) .cse24) 4) 0) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse0))) (not (= v_ArrVal_2229 (store (select .cse22 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))) (= .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) .cse13) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int) (v_arrayElimArr_18 (Array Int Int))) (let ((.cse27 (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18)) (.cse29 (select v_arrayElimArr_18 4))) (store .cse28 .cse29 (store (select .cse28 .cse29) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse26) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= (select (select .cse27 .cse26) 4) 0))))) .cse13) (or (not .cse13) (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int))) (let ((.cse31 (select (select (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (store .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse30 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (or (= (select (select (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2229) .cse31) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse31) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (not (= (select v_arrayElimArr_16 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 4))) (not (= (store (select .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229)))))) (or .cse13 (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int))) (let ((.cse34 (select v_arrayElimArr_17 4))) (let ((.cse33 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse35 (select (select (let ((.cse36 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (store .cse36 .cse34 (store (select .cse36 .cse34) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= (select (select (store .cse33 .cse34 v_ArrVal_2229) .cse35) 4) 0) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse0))) (not (= v_ArrVal_2229 (store (select .cse33 .cse34) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))) (= .cse35 |c_ULTIMATE.start_node_create_~temp~0#1.base|)))))))) is different from false [2024-12-02 06:40:08,655 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_78| Int) (v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_78| v_arrayElimArr_17))) (store .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))) |v_ULTIMATE.start_node_create_~temp~0#1.base_78|) 4)) (.cse1 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_78| v_arrayElimArr_16)) (.cse2 (select v_arrayElimArr_16 4))) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_78| .cse0) (= (select (select (store .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2229) .cse0) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_78|) 0)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_17 4))) (not (= (store (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| (select v_ArrVal_2229 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)) v_ArrVal_2229)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| .cse2) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_78| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_92| Int) (v_ArrVal_2231 Int) (v_arrayElimArr_18 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_78| v_arrayElimArr_18))) (store .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_92| v_ArrVal_2231))))) (let ((.cse5 (select (select .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_78|) 4))) (or (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_18 4))) (= (select (select .cse4 .cse5) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_78|) 0)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_92|) (= .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_78|)))))) is different from false [2024-12-02 06:40:08,779 INFO L349 Elim1Store]: treesize reduction 34, result has 64.2 percent of original size [2024-12-02 06:40:08,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 531 treesize of output 466 [2024-12-02 06:40:08,867 INFO L349 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2024-12-02 06:40:08,868 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 575 treesize of output 588 [2024-12-02 06:40:08,957 INFO L349 Elim1Store]: treesize reduction 44, result has 63.3 percent of original size [2024-12-02 06:40:08,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 524 treesize of output 566 [2024-12-02 06:40:08,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 521 treesize of output 489 [2024-12-02 06:40:09,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:40:09,027 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 367 treesize of output 385 [2024-12-02 06:40:09,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:40:09,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 450 treesize of output 464 [2024-12-02 06:40:09,125 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-12-02 06:40:09,125 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 370 treesize of output 379 [2024-12-02 06:40:09,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 606 treesize of output 572 [2024-12-02 06:40:09,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:40:09,668 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 69 treesize of output 71 [2024-12-02 06:40:09,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:40:09,740 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 54 treesize of output 56 [2024-12-02 06:40:09,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:40:09,764 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 21 treesize of output 23 [2024-12-02 06:40:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2024-12-02 06:40:09,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97385708] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:40:09,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:40:09,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 73 [2024-12-02 06:40:09,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297679587] [2024-12-02 06:40:09,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:40:09,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-12-02 06:40:09,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:40:09,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-12-02 06:40:09,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3822, Unknown=17, NotChecked=1188, Total=5256 [2024-12-02 06:40:09,794 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 73 states, 73 states have (on average 2.2739726027397262) internal successors, (166), 73 states have internal predecessors, (166), 0 states have call successors, (0), 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-12-02 06:40:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:40:12,671 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2024-12-02 06:40:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-12-02 06:40:12,671 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.2739726027397262) internal successors, (166), 73 states have internal predecessors, (166), 0 states have call successors, (0), 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 71 [2024-12-02 06:40:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:40:12,672 INFO L225 Difference]: With dead ends: 142 [2024-12-02 06:40:12,672 INFO L226 Difference]: Without dead ends: 142 [2024-12-02 06:40:12,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 102 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=371, Invalid=6128, Unknown=17, NotChecked=1494, Total=8010 [2024-12-02 06:40:12,673 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 79 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 680 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:40:12,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1304 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1531 Invalid, 0 Unknown, 680 Unchecked, 1.0s Time] [2024-12-02 06:40:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-12-02 06:40:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-12-02 06:40:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 138 states have internal predecessors, (145), 0 states have call successors, (0), 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-12-02 06:40:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2024-12-02 06:40:12,675 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 71 [2024-12-02 06:40:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:40:12,676 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2024-12-02 06:40:12,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.2739726027397262) internal successors, (166), 73 states have internal predecessors, (166), 0 states have call successors, (0), 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-12-02 06:40:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2024-12-02 06:40:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 06:40:12,676 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:40:12,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:40:12,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-12-02 06:40:12,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:40:12,877 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:40:12,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:40:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -955954715, now seen corresponding path program 2 times [2024-12-02 06:40:12,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:40:12,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160515409] [2024-12-02 06:40:12,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:40:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:40:12,902 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 06:40:12,902 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:40:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 06:40:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:40:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160515409] [2024-12-02 06:40:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160515409] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:40:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641767954] [2024-12-02 06:40:14,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:40:14,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:40:14,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:40:14,007 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:40:14,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 06:40:14,228 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 06:40:14,228 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:40:14,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-12-02 06:40:14,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:40:14,354 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-12-02 06:40:14,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-12-02 06:40:14,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-02 06:40:14,737 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-12-02 06:40:14,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 49 [2024-12-02 06:40:14,748 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 06:40:14,748 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 29 treesize of output 25 [2024-12-02 06:40:14,959 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-12-02 06:40:14,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2024-12-02 06:40:15,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:40:15,466 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 59 treesize of output 53 [2024-12-02 06:40:15,778 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-12-02 06:40:15,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 41 [2024-12-02 06:40:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-02 06:40:15,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:40:16,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) v_ArrVal_2347) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-12-02 06:40:16,628 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) v_ArrVal_2347) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-12-02 06:40:16,632 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) v_ArrVal_2347) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-12-02 06:40:16,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) v_ArrVal_2347) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-12-02 06:40:16,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:40:16,645 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 2 case distinctions, treesize of input 39 treesize of output 39 [2024-12-02 06:40:16,663 INFO L349 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2024-12-02 06:40:16,663 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 2 case distinctions, treesize of input 63 treesize of output 73 [2024-12-02 06:40:16,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 06:40:16,671 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 117 treesize of output 107 [2024-12-02 06:40:16,674 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 82 [2024-12-02 06:41:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 6 not checked. [2024-12-02 06:41:59,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641767954] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:41:59,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:41:59,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 64 [2024-12-02 06:41:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166452662] [2024-12-02 06:41:59,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:41:59,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-12-02 06:41:59,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:41:59,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-12-02 06:41:59,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3452, Unknown=16, NotChecked=484, Total=4160 [2024-12-02 06:41:59,334 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand has 65 states, 64 states have (on average 2.65625) internal successors, (170), 65 states have internal predecessors, (170), 0 states have call successors, (0), 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-12-02 06:42:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:42:01,277 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2024-12-02 06:42:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-12-02 06:42:01,278 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.65625) internal successors, (170), 65 states have internal predecessors, (170), 0 states have call successors, (0), 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 72 [2024-12-02 06:42:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:42:01,278 INFO L225 Difference]: With dead ends: 142 [2024-12-02 06:42:01,278 INFO L226 Difference]: Without dead ends: 91 [2024-12-02 06:42:01,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 103 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 104.5s TimeCoverageRelationStatistics Valid=284, Invalid=4408, Unknown=16, NotChecked=548, Total=5256 [2024-12-02 06:42:01,279 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 06:42:01,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 969 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1410 Invalid, 1 Unknown, 314 Unchecked, 1.4s Time] [2024-12-02 06:42:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-12-02 06:42:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-12-02 06:42:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 89 states have internal predecessors, (93), 0 states have call successors, (0), 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-12-02 06:42:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2024-12-02 06:42:01,281 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 72 [2024-12-02 06:42:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:42:01,281 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2024-12-02 06:42:01,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.65625) internal successors, (170), 65 states have internal predecessors, (170), 0 states have call successors, (0), 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-12-02 06:42:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2024-12-02 06:42:01,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-02 06:42:01,281 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 06:42:01,282 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:42:01,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-12-02 06:42:01,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:42:01,482 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-12-02 06:42:01,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:42:01,482 INFO L85 PathProgramCache]: Analyzing trace with hash -690980297, now seen corresponding path program 3 times [2024-12-02 06:42:01,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:42:01,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097762839] [2024-12-02 06:42:01,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 06:42:01,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:42:01,511 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-12-02 06:42:01,511 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:42:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-02 06:42:01,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:42:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097762839] [2024-12-02 06:42:01,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097762839] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:42:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130962726] [2024-12-02 06:42:01,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 06:42:01,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:42:01,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:42:01,572 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:42:01,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 06:42:02,051 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-12-02 06:42:02,051 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:42:02,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 06:42:02,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:42:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-02 06:42:02,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 06:42:02,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130962726] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:42:02,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 06:42:02,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-12-02 06:42:02,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324316861] [2024-12-02 06:42:02,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:42:02,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:42:02,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:42:02,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:42:02,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:42:02,080 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:42:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 06:42:02,087 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-12-02 06:42:02,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:42:02,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-12-02 06:42:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 06:42:02,087 INFO L225 Difference]: With dead ends: 21 [2024-12-02 06:42:02,087 INFO L226 Difference]: Without dead ends: 0 [2024-12-02 06:42:02,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:42:02,088 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 06:42:02,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 06:42:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-12-02 06:42:02,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-12-02 06:42:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-12-02 06:42:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-12-02 06:42:02,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-12-02 06:42:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 06:42:02,089 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-12-02 06:42:02,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:42:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-12-02 06:42:02,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-02 06:42:02,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-12-02 06:42:02,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-12-02 06:42:02,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-12-02 06:42:02,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-12-02 06:42:02,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-12-02 06:42:02,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2024-12-02 06:42:02,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2024-12-02 06:42:02,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2024-12-02 06:42:02,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2024-12-02 06:42:02,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-12-02 06:42:02,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-12-02 06:42:02,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:42:02,295 INFO L422 BasicCegarLoop]: Path program histogram: [3, 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-12-02 06:42:02,297 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 06:42:02,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:42:02 BoogieIcfgContainer [2024-12-02 06:42:02,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 06:42:02,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 06:42:02,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 06:42:02,300 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 06:42:02,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:39:02" (3/4) ... [2024-12-02 06:42:02,302 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-02 06:42:02,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-12-02 06:42:02,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-12-02 06:42:02,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-02 06:42:02,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-02 06:42:02,365 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 06:42:02,365 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 06:42:02,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 06:42:02,366 INFO L158 Benchmark]: Toolchain (without parser) took 181096.97ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 92.0MB in the beginning and 306.5MB in the end (delta: -214.5MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2024-12-02 06:42:02,366 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 06:42:02,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.24ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 74.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 06:42:02,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.25ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 72.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 06:42:02,366 INFO L158 Benchmark]: Boogie Preprocessor took 39.11ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 70.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 06:42:02,367 INFO L158 Benchmark]: RCFGBuilder took 398.06ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 52.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 06:42:02,367 INFO L158 Benchmark]: TraceAbstraction took 180156.83ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 51.7MB in the beginning and 310.8MB in the end (delta: -259.1MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-12-02 06:42:02,367 INFO L158 Benchmark]: Witness Printer took 66.17ms. Allocated memory is still 419.4MB. Free memory was 310.8MB in the beginning and 306.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 06:42:02,368 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.24ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 74.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.25ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 72.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.11ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 70.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 398.06ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 52.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 180156.83ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 51.7MB in the beginning and 310.8MB in the end (delta: -259.1MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 66.17ms. Allocated memory is still 419.4MB. Free memory was 310.8MB in the beginning and 306.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 180.1s, OverallIterations: 35, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1758 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1758 mSDsluCounter, 15509 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2475 IncrementalHoareTripleChecker+Unchecked, 14013 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16935 IncrementalHoareTripleChecker+Invalid, 19575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 1496 mSDtfsCounter, 16935 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2407 GetRequests, 1429 SyntacticMatches, 57 SemanticMatches, 921 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 11167 ImplicationChecksByTransitivity, 135.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=33, InterpolantAutomatonStates: 452, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 155 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 152.1s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 3211 ConstructedInterpolants, 260 QuantifiedInterpolants, 52299 SizeOfPredicates, 98 NumberOfNonLiveVariables, 6550 ConjunctsInSsa, 942 ConjunctsInUnsatCore, 70 InterpolantComputations, 19 PerfectInterpolantSequences, 957/1601 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-12-02 06:42:02,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7b5f25c-2851-4c73-9e17-92fffc97f420/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE