./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_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_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/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_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/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_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 07:55:52,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 07:55:52,562 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 07:55:52,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 07:55:52,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 07:55:52,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 07:55:52,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 07:55:52,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 07:55:52,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 07:55:52,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 07:55:52,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 07:55:52,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 07:55:52,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 07:55:52,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 07:55:52,589 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 07:55:52,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 07:55:52,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 07:55:52,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 07:55:52,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 07:55:52,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 07:55:52,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 07:55:52,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 07:55:52,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 07:55:52,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 07:55:52,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 07:55:52,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 07:55:52,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 07:55:52,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 07:55:52,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 07:55:52,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 07:55:52,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 07:55:52,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 07:55:52,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 07:55:52,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 07:55:52,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 07:55:52,592 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_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2024-12-02 07:55:52,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 07:55:52,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 07:55:52,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 07:55:52,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 07:55:52,819 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 07:55:52,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2024-12-02 07:55:55,417 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/data/43864be22/05a6f55c878c48649c700c4d901f30a1/FLAG2b03b03ba [2024-12-02 07:55:55,680 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 07:55:55,681 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2024-12-02 07:55:55,692 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/data/43864be22/05a6f55c878c48649c700c4d901f30a1/FLAG2b03b03ba [2024-12-02 07:55:55,981 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/data/43864be22/05a6f55c878c48649c700c4d901f30a1 [2024-12-02 07:55:55,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 07:55:55,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 07:55:55,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 07:55:55,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 07:55:55,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 07:55:55,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:55:55" (1/1) ... [2024-12-02 07:55:55,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48358a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:55, skipping insertion in model container [2024-12-02 07:55:55,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:55:55" (1/1) ... [2024-12-02 07:55:56,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 07:55:56,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 07:55:56,260 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 07:55:56,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 07:55:56,321 INFO L204 MainTranslator]: Completed translation [2024-12-02 07:55:56,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56 WrapperNode [2024-12-02 07:55:56,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 07:55:56,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 07:55:56,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 07:55:56,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 07:55:56,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,359 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2024-12-02 07:55:56,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 07:55:56,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 07:55:56,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 07:55:56,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 07:55:56,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,386 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-12-02 07:55:56,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,395 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 07:55:56,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 07:55:56,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 07:55:56,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 07:55:56,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (1/1) ... [2024-12-02 07:55:56,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 07:55:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:55:56,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 07:55:56,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 07:55:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-12-02 07:55:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-12-02 07:55:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 07:55:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 07:55:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 07:55:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 07:55:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 07:55:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 07:55:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 07:55:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 07:55:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 07:55:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 07:55:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 07:55:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 07:55:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 07:55:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 07:55:56,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 07:55:56,550 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 07:55:56,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 07:55:56,567 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-12-02 07:55:56,774 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-12-02 07:55:56,774 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 07:55:56,784 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 07:55:56,784 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-12-02 07:55:56,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:55:56 BoogieIcfgContainer [2024-12-02 07:55:56,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 07:55:56,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 07:55:56,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 07:55:56,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 07:55:56,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:55:55" (1/3) ... [2024-12-02 07:55:56,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677c156e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:55:56, skipping insertion in model container [2024-12-02 07:55:56,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:55:56" (2/3) ... [2024-12-02 07:55:56,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677c156e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:55:56, skipping insertion in model container [2024-12-02 07:55:56,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:55:56" (3/3) ... [2024-12-02 07:55:56,793 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2024-12-02 07:55:56,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 07:55:56,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_update_all_reverse.i that has 2 procedures, 72 locations, 1 initial locations, 6 loop locations, and 23 error locations. [2024-12-02 07:55:56,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 07:55:56,857 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;@479b0535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 07:55:56,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-12-02 07:55:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 69 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:55:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 07:55:56,866 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:55:56,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 07:55:56,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:55:56,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:55:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518442, now seen corresponding path program 1 times [2024-12-02 07:55:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:55:56,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137658878] [2024-12-02 07:55:56,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:55:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:57,040 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 07:55:57,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:55:57,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137658878] [2024-12-02 07:55:57,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137658878] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:55:57,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:55:57,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 07:55:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140372077] [2024-12-02 07:55:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:55:57,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 07:55:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:55:57,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 07:55:57,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 07:55:57,075 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 69 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 07:55:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:55:57,146 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-12-02 07:55:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 07:55:57,148 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 07:55:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:55:57,152 INFO L225 Difference]: With dead ends: 67 [2024-12-02 07:55:57,152 INFO L226 Difference]: Without dead ends: 62 [2024-12-02 07:55:57,153 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 07:55:57,155 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 07:55:57,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 104 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 07:55:57,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-12-02 07:55:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-12-02 07:55:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.619047619047619) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:55:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-12-02 07:55:57,181 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 6 [2024-12-02 07:55:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:55:57,182 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-12-02 07:55:57,182 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 07:55:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-12-02 07:55:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 07:55:57,182 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:55:57,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 07:55:57,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 07:55:57,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:55:57,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:55:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518443, now seen corresponding path program 1 times [2024-12-02 07:55:57,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:55:57,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099133427] [2024-12-02 07:55:57,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:55:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:57,279 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 07:55:57,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:55:57,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099133427] [2024-12-02 07:55:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099133427] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:55:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:55:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 07:55:57,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202396357] [2024-12-02 07:55:57,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:55:57,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 07:55:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:55:57,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 07:55:57,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 07:55:57,282 INFO L87 Difference]: Start difference. First operand 62 states and 68 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 07:55:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:55:57,329 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-12-02 07:55:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 07:55:57,330 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 07:55:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:55:57,330 INFO L225 Difference]: With dead ends: 59 [2024-12-02 07:55:57,330 INFO L226 Difference]: Without dead ends: 59 [2024-12-02 07:55:57,331 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 07:55:57,331 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 07:55:57,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:55:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-12-02 07:55:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-12-02 07:55:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 58 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 07:55:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-12-02 07:55:57,334 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 6 [2024-12-02 07:55:57,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:55:57,335 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-12-02 07:55:57,335 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 07:55:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-12-02 07:55:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-02 07:55:57,335 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:55:57,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:55:57,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 07:55:57,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:55:57,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:55:57,336 INFO L85 PathProgramCache]: Analyzing trace with hash 491092471, now seen corresponding path program 1 times [2024-12-02 07:55:57,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:55:57,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803067312] [2024-12-02 07:55:57,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:57,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:55:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:57,382 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 07:55:57,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:55:57,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803067312] [2024-12-02 07:55:57,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803067312] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:55:57,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:55:57,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 07:55:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075167782] [2024-12-02 07:55:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:55:57,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 07:55:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:55:57,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 07:55:57,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 07:55:57,384 INFO L87 Difference]: Start difference. First operand 59 states and 65 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 07:55:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:55:57,395 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-12-02 07:55:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 07:55:57,395 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 07:55:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:55:57,396 INFO L225 Difference]: With dead ends: 70 [2024-12-02 07:55:57,396 INFO L226 Difference]: Without dead ends: 70 [2024-12-02 07:55:57,396 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 07:55:57,397 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 11 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 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 07:55:57,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:55:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-12-02 07:55:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-12-02 07:55:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 59 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 07:55:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-12-02 07:55:57,400 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 9 [2024-12-02 07:55:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:55:57,401 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-12-02 07:55:57,401 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 07:55:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-12-02 07:55:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 07:55:57,401 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:55:57,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:55:57,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 07:55:57,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:55:57,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:55:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1519983918, now seen corresponding path program 1 times [2024-12-02 07:55:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:55:57,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623832955] [2024-12-02 07:55:57,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:55:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:57,463 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 07:55:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:55:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623832955] [2024-12-02 07:55:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623832955] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:55:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:55:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 07:55:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313103257] [2024-12-02 07:55:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:55:57,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 07:55:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:55:57,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 07:55:57,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 07:55:57,465 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 07:55:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:55:57,491 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-12-02 07:55:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 07:55:57,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 07:55:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:55:57,492 INFO L225 Difference]: With dead ends: 66 [2024-12-02 07:55:57,492 INFO L226 Difference]: Without dead ends: 66 [2024-12-02 07:55:57,492 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 07:55:57,493 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 07:55:57,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:55:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-12-02 07:55:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-12-02 07:55:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.469387755102041) internal successors, (72), 65 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 07:55:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-12-02 07:55:57,498 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 10 [2024-12-02 07:55:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:55:57,499 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-12-02 07:55:57,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 07:55:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-12-02 07:55:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-02 07:55:57,500 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:55:57,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:55:57,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 07:55:57,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:55:57,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:55:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1123286484, now seen corresponding path program 1 times [2024-12-02 07:55:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:55:57,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23642927] [2024-12-02 07:55:57,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:57,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:55:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:57,593 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 07:55:57,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:55:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23642927] [2024-12-02 07:55:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23642927] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:55:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228972767] [2024-12-02 07:55:57,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:57,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:55:57,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:55:57,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:55:57,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 07:55:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:57,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 07:55:57,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:55:57,732 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 07:55:57,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:55:57,766 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 07:55:57,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228972767] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:55:57,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:55:57,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-12-02 07:55:57,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662587724] [2024-12-02 07:55:57,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:55:57,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 07:55:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:55:57,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 07:55:57,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-12-02 07:55:57,768 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 07:55:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:55:57,787 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-12-02 07:55:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 07:55:57,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 17 [2024-12-02 07:55:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:55:57,789 INFO L225 Difference]: With dead ends: 68 [2024-12-02 07:55:57,789 INFO L226 Difference]: Without dead ends: 68 [2024-12-02 07:55:57,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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 07:55:57,790 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 133 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 07:55:57,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:55:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-12-02 07:55:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-12-02 07:55:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 67 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 07:55:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-12-02 07:55:57,795 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 17 [2024-12-02 07:55:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:55:57,795 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-12-02 07:55:57,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 07:55:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-12-02 07:55:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 07:55:57,795 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:55:57,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-12-02 07:55:57,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 07:55:57,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:55:57,996 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:55:57,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:55:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123431, now seen corresponding path program 1 times [2024-12-02 07:55:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:55:57,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541364635] [2024-12-02 07:55:57,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:55:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:55:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:55:58,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541364635] [2024-12-02 07:55:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541364635] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:55:58,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013968262] [2024-12-02 07:55:58,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:58,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:55:58,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:55:58,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:55:58,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 07:55:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:58,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-02 07:55:58,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:55:58,272 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 07:55:58,307 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-12-02 07:55:58,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-12-02 07:55:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:55:58,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:55:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:55:58,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013968262] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:55:58,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:55:58,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-12-02 07:55:58,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697593263] [2024-12-02 07:55:58,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:55:58,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 07:55:58,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:55:58,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 07:55:58,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 07:55:58,375 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 07:55:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:55:58,476 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-12-02 07:55:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 07:55:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 18 [2024-12-02 07:55:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:55:58,477 INFO L225 Difference]: With dead ends: 67 [2024-12-02 07:55:58,477 INFO L226 Difference]: Without dead ends: 67 [2024-12-02 07:55:58,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 07:55:58,478 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 07:55:58,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 166 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 07:55:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-12-02 07:55:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-12-02 07:55:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:55:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-12-02 07:55:58,483 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 18 [2024-12-02 07:55:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:55:58,483 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-12-02 07:55:58,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 07:55:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-12-02 07:55:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 07:55:58,483 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:55:58,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-12-02 07:55:58,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 07:55:58,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-12-02 07:55:58,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:55:58,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:55:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123430, now seen corresponding path program 1 times [2024-12-02 07:55:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:55:58,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922847159] [2024-12-02 07:55:58,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:55:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:55:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:55:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922847159] [2024-12-02 07:55:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922847159] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:55:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894288922] [2024-12-02 07:55:58,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:55:58,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:55:58,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:55:58,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:55:58,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 07:55:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:55:58,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 07:55:58,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:55:58,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 07:55:58,994 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 07:55:59,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:55:59,071 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 07:55:59,080 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 07:55:59,080 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 07:55:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:55:59,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:55:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:55:59,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894288922] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:55:59,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:55:59,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-12-02 07:55:59,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675935409] [2024-12-02 07:55:59,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:55:59,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 07:55:59,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:55:59,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 07:55:59,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-12-02 07:55:59,411 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 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 07:55:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:55:59,570 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-12-02 07:55:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 07:55:59,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 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 18 [2024-12-02 07:55:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:55:59,571 INFO L225 Difference]: With dead ends: 66 [2024-12-02 07:55:59,571 INFO L226 Difference]: Without dead ends: 66 [2024-12-02 07:55:59,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-12-02 07:55:59,572 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 07:55:59,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 280 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 07:55:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-12-02 07:55:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-12-02 07:55:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.411764705882353) internal successors, (72), 65 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 07:55:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-12-02 07:55:59,576 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 18 [2024-12-02 07:55:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:55:59,576 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-12-02 07:55:59,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 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 07:55:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-12-02 07:55:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-02 07:55:59,577 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:55:59,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:55:59,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 07:55:59,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:55:59,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:55:59,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:55:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1140163937, now seen corresponding path program 2 times [2024-12-02 07:55:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:55:59,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909467456] [2024-12-02 07:55:59,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 07:55:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:55:59,807 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 07:55:59,807 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 07:55:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:55:59,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:55:59,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909467456] [2024-12-02 07:55:59,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909467456] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:55:59,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231250720] [2024-12-02 07:55:59,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 07:55:59,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:55:59,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:55:59,854 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:55:59,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 07:55:59,954 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 07:55:59,954 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 07:55:59,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 07:55:59,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:55:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:55:59,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:56:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:56:00,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231250720] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:56:00,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:56:00,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-12-02 07:56:00,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286304464] [2024-12-02 07:56:00,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:56:00,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 07:56:00,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:00,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 07:56:00,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 07:56:00,002 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 07:56:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:00,033 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2024-12-02 07:56:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 07:56:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-12-02 07:56:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:00,034 INFO L225 Difference]: With dead ends: 66 [2024-12-02 07:56:00,034 INFO L226 Difference]: Without dead ends: 66 [2024-12-02 07:56:00,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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 07:56:00,035 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:00,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 160 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:56:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-12-02 07:56:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-12-02 07:56:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.392156862745098) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-12-02 07:56:00,039 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 25 [2024-12-02 07:56:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:00,040 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-12-02 07:56:00,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 07:56:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-12-02 07:56:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 07:56:00,040 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:00,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:00,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 07:56:00,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:00,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:00,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1211453241, now seen corresponding path program 1 times [2024-12-02 07:56:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:00,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148072355] [2024-12-02 07:56:00,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 07:56:00,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:00,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148072355] [2024-12-02 07:56:00,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148072355] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:56:00,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:56:00,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 07:56:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966107717] [2024-12-02 07:56:00,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:56:00,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 07:56:00,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:00,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 07:56:00,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 07:56:00,338 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 07:56:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:00,458 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-12-02 07:56:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 07:56:00,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 26 [2024-12-02 07:56:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:00,459 INFO L225 Difference]: With dead ends: 69 [2024-12-02 07:56:00,459 INFO L226 Difference]: Without dead ends: 69 [2024-12-02 07:56:00,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-12-02 07:56:00,460 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:00,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 185 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 07:56:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-12-02 07:56:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-12-02 07:56:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 68 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 07:56:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-12-02 07:56:00,464 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 26 [2024-12-02 07:56:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:00,464 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-12-02 07:56:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 07:56:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-12-02 07:56:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 07:56:00,465 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:00,465 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:00,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 07:56:00,465 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:00,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1211453240, now seen corresponding path program 1 times [2024-12-02 07:56:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971231392] [2024-12-02 07:56:00,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 07:56:00,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:00,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971231392] [2024-12-02 07:56:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971231392] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:56:00,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:56:00,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 07:56:00,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747984343] [2024-12-02 07:56:00,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:56:00,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 07:56:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:00,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 07:56:00,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 07:56:00,656 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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 07:56:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:00,780 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-12-02 07:56:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 07:56:00,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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 26 [2024-12-02 07:56:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:00,781 INFO L225 Difference]: With dead ends: 69 [2024-12-02 07:56:00,781 INFO L226 Difference]: Without dead ends: 69 [2024-12-02 07:56:00,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-12-02 07:56:00,782 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:00,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 209 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 07:56:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-12-02 07:56:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-12-02 07:56:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-12-02 07:56:00,785 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 26 [2024-12-02 07:56:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:00,785 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-12-02 07:56:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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 07:56:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-12-02 07:56:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 07:56:00,786 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:00,786 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:00,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 07:56:00,786 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:00,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash -189310014, now seen corresponding path program 1 times [2024-12-02 07:56:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:00,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632413848] [2024-12-02 07:56:00,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 07:56:00,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632413848] [2024-12-02 07:56:00,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632413848] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542221029] [2024-12-02 07:56:00,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:00,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:00,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:00,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:00,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 07:56:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:01,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 07:56:01,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 07:56:01,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 07:56:01,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542221029] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:56:01,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 07:56:01,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-12-02 07:56:01,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326613839] [2024-12-02 07:56:01,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:56:01,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 07:56:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:01,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 07:56:01,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 07:56:01,064 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:01,084 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-12-02 07:56:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 07:56:01,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-12-02 07:56:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:01,085 INFO L225 Difference]: With dead ends: 67 [2024-12-02 07:56:01,086 INFO L226 Difference]: Without dead ends: 67 [2024-12-02 07:56:01,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 07:56:01,086 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 54 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:01,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 77 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:56:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-12-02 07:56:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2024-12-02 07:56:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 07:56:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-12-02 07:56:01,090 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2024-12-02 07:56:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:01,090 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-12-02 07:56:01,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-12-02 07:56:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-02 07:56:01,090 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:01,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:01,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 07:56:01,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:01,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:01,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 206727143, now seen corresponding path program 1 times [2024-12-02 07:56:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:01,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054299605] [2024-12-02 07:56:01,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 07:56:01,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:01,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054299605] [2024-12-02 07:56:01,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054299605] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:01,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839981946] [2024-12-02 07:56:01,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:01,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:01,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:01,473 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:01,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 07:56:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:01,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 07:56:01,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 07:56:01,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 07:56:01,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839981946] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:56:01,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 07:56:01,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-12-02 07:56:01,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242672688] [2024-12-02 07:56:01,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:56:01,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 07:56:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:01,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 07:56:01,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-12-02 07:56:01,647 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:01,691 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-12-02 07:56:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 07:56:01,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-12-02 07:56:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:01,692 INFO L225 Difference]: With dead ends: 51 [2024-12-02 07:56:01,692 INFO L226 Difference]: Without dead ends: 51 [2024-12-02 07:56:01,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-12-02 07:56:01,692 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:01,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 95 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:56:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-12-02 07:56:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-12-02 07:56:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.255813953488372) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-12-02 07:56:01,695 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 29 [2024-12-02 07:56:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:01,695 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-12-02 07:56:01,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-12-02 07:56:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-02 07:56:01,696 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:01,696 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:01,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 07:56:01,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:01,897 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:01,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:01,897 INFO L85 PathProgramCache]: Analyzing trace with hash 206727212, now seen corresponding path program 1 times [2024-12-02 07:56:01,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:01,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475105578] [2024-12-02 07:56:01,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:01,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:56:02,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475105578] [2024-12-02 07:56:02,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475105578] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202033641] [2024-12-02 07:56:02,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:02,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:02,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:02,509 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:02,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 07:56:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:02,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 07:56:02,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:02,637 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 07:56:02,671 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 07:56:02,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 07:56:02,697 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 13 treesize of output 9 [2024-12-02 07:56:02,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-12-02 07:56:02,772 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 07:56:02,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 07:56:02,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:02,982 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 40 treesize of output 16 [2024-12-02 07:56:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:56:02,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:56:03,118 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-12-02 07:56:03,118 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 07:56:03,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-12-02 07:56:03,134 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-12-02 07:56:03,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:03,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-12-02 07:56:03,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:03,150 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 46 treesize of output 28 [2024-12-02 07:56:03,155 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 07:56:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-12-02 07:56:03,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202033641] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:56:03,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:56:03,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2024-12-02 07:56:03,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128242928] [2024-12-02 07:56:03,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:56:03,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 07:56:03,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:03,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 07:56:03,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=790, Unknown=2, NotChecked=114, Total=992 [2024-12-02 07:56:03,218 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 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 07:56:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:03,943 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-12-02 07:56:03,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 07:56:03,944 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 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) Word has length 29 [2024-12-02 07:56:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:03,944 INFO L225 Difference]: With dead ends: 71 [2024-12-02 07:56:03,944 INFO L226 Difference]: Without dead ends: 71 [2024-12-02 07:56:03,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=1571, Unknown=2, NotChecked=166, Total=1980 [2024-12-02 07:56:03,946 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:03,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 511 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 601 Invalid, 0 Unknown, 86 Unchecked, 0.3s Time] [2024-12-02 07:56:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-12-02 07:56:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2024-12-02 07:56:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 59 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 07:56:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-12-02 07:56:03,949 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 29 [2024-12-02 07:56:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:03,949 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-12-02 07:56:03,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 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 07:56:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-12-02 07:56:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-02 07:56:03,950 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:03,950 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:03,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 07:56:04,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:04,151 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:04,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash 206727213, now seen corresponding path program 1 times [2024-12-02 07:56:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:04,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138229326] [2024-12-02 07:56:04,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:56:04,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:04,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138229326] [2024-12-02 07:56:04,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138229326] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:04,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116144914] [2024-12-02 07:56:04,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:04,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:04,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:04,913 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:04,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 07:56:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:05,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-12-02 07:56:05,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:05,047 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 07:56:05,051 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 07:56:05,138 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 07:56:05,139 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 07:56:05,143 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 07:56:05,181 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 13 treesize of output 9 [2024-12-02 07:56:05,185 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 13 treesize of output 9 [2024-12-02 07:56:05,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 23 treesize of output 22 [2024-12-02 07:56:05,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-12-02 07:56:05,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 07:56:05,279 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 71 treesize of output 64 [2024-12-02 07:56:05,284 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 30 treesize of output 13 [2024-12-02 07:56:05,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-12-02 07:56:05,501 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 07:56:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:56:05,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:56:05,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_782 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))))) is different from false [2024-12-02 07:56:05,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_781 Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_781)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))) (forall ((v_ArrVal_781 Int) (v_ArrVal_782 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_781)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))) is different from false [2024-12-02 07:56:05,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:05,873 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 2 case distinctions, treesize of input 27 treesize of output 33 [2024-12-02 07:56:05,876 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 07:56:05,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:05,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 61 [2024-12-02 07:56:05,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:05,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2024-12-02 07:56:05,904 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:05,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-12-02 07:56:05,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:05,910 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 24 treesize of output 12 [2024-12-02 07:56:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-12-02 07:56:06,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116144914] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:56:06,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:56:06,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2024-12-02 07:56:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057028317] [2024-12-02 07:56:06,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:56:06,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-12-02 07:56:06,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:06,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-12-02 07:56:06,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1169, Unknown=2, NotChecked=138, Total=1406 [2024-12-02 07:56:06,185 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 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 07:56:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:07,215 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2024-12-02 07:56:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 07:56:07,215 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 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) Word has length 29 [2024-12-02 07:56:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:07,215 INFO L225 Difference]: With dead ends: 66 [2024-12-02 07:56:07,215 INFO L226 Difference]: Without dead ends: 66 [2024-12-02 07:56:07,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=294, Invalid=2262, Unknown=2, NotChecked=198, Total=2756 [2024-12-02 07:56:07,217 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:07,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 511 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 602 Invalid, 0 Unknown, 86 Unchecked, 0.3s Time] [2024-12-02 07:56:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-12-02 07:56:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2024-12-02 07:56:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2352941176470589) 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 07:56:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-12-02 07:56:07,220 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 29 [2024-12-02 07:56:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:07,220 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-12-02 07:56:07,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 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 07:56:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-12-02 07:56:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-02 07:56:07,221 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:07,221 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:07,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 07:56:07,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:07,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:07,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:07,422 INFO L85 PathProgramCache]: Analyzing trace with hash -441759130, now seen corresponding path program 1 times [2024-12-02 07:56:07,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:07,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548363091] [2024-12-02 07:56:07,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:07,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 07:56:07,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548363091] [2024-12-02 07:56:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548363091] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:56:07,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:56:07,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 07:56:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083075205] [2024-12-02 07:56:07,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:56:07,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 07:56:07,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:07,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 07:56:07,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 07:56:07,519 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:07,612 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-12-02 07:56:07,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 07:56:07,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-12-02 07:56:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:07,613 INFO L225 Difference]: With dead ends: 59 [2024-12-02 07:56:07,613 INFO L226 Difference]: Without dead ends: 59 [2024-12-02 07:56:07,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 07:56:07,613 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:07,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 85 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 07:56:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-12-02 07:56:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-12-02 07:56:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 58 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 07:56:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-12-02 07:56:07,616 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 33 [2024-12-02 07:56:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:07,616 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-12-02 07:56:07,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-12-02 07:56:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-02 07:56:07,617 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:07,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:07,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 07:56:07,618 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:07,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -441759129, now seen corresponding path program 1 times [2024-12-02 07:56:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880817320] [2024-12-02 07:56:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 07:56:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:07,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880817320] [2024-12-02 07:56:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880817320] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201927433] [2024-12-02 07:56:07,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:07,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:07,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:07,727 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:07,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 07:56:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:07,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 07:56:07,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 07:56:07,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 07:56:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201927433] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:56:07,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 07:56:07,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-12-02 07:56:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744881192] [2024-12-02 07:56:07,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:56:07,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 07:56:07,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:07,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 07:56:07,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-12-02 07:56:07,908 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 07:56:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:07,944 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-12-02 07:56:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 07:56:07,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 33 [2024-12-02 07:56:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:07,945 INFO L225 Difference]: With dead ends: 58 [2024-12-02 07:56:07,945 INFO L226 Difference]: Without dead ends: 58 [2024-12-02 07:56:07,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-12-02 07:56:07,946 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:07,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 97 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:56:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-12-02 07:56:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-12-02 07:56:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.22) internal successors, (61), 55 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 07:56:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-12-02 07:56:07,948 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 33 [2024-12-02 07:56:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:07,949 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-12-02 07:56:07,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 07:56:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-12-02 07:56:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-02 07:56:07,949 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:07,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:07,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 07:56:08,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 07:56:08,150 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:08,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:08,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1367519417, now seen corresponding path program 1 times [2024-12-02 07:56:08,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:08,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137042703] [2024-12-02 07:56:08,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 07:56:08,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:08,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137042703] [2024-12-02 07:56:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137042703] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927320245] [2024-12-02 07:56:08,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:08,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:08,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:08,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:08,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 07:56:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:08,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 07:56:08,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 07:56:08,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:56:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 07:56:08,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927320245] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:56:08,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:56:08,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-12-02 07:56:08,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602283230] [2024-12-02 07:56:08,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:56:08,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 07:56:08,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:08,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 07:56:08,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 07:56:08,488 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 07:56:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:08,513 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-12-02 07:56:08,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 07:56:08,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-12-02 07:56:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:08,514 INFO L225 Difference]: With dead ends: 59 [2024-12-02 07:56:08,514 INFO L226 Difference]: Without dead ends: 59 [2024-12-02 07:56:08,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-12-02 07:56:08,514 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 80 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:08,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 129 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:56:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-12-02 07:56:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-12-02 07:56:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.2075471698113207) 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 07:56:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-12-02 07:56:08,517 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 36 [2024-12-02 07:56:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:08,517 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-12-02 07:56:08,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 07:56:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-12-02 07:56:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 07:56:08,517 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:08,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:08,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 07:56:08,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 07:56:08,718 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:08,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:08,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1960827259, now seen corresponding path program 1 times [2024-12-02 07:56:08,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:08,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417646450] [2024-12-02 07:56:08,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:08,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 07:56:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417646450] [2024-12-02 07:56:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417646450] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219964466] [2024-12-02 07:56:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:08,812 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:08,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 07:56:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:08,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 07:56:08,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 07:56:09,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:56:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 07:56:09,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219964466] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:56:09,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:56:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-12-02 07:56:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223507375] [2024-12-02 07:56:09,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:56:09,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 07:56:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:09,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 07:56:09,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 07:56:09,058 INFO L87 Difference]: Start difference. First operand 59 states and 64 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 07:56:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:09,120 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-12-02 07:56:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 07:56:09,120 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 37 [2024-12-02 07:56:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:09,121 INFO L225 Difference]: With dead ends: 54 [2024-12-02 07:56:09,121 INFO L226 Difference]: Without dead ends: 54 [2024-12-02 07:56:09,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-12-02 07:56:09,121 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:09,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 150 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 07:56:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-12-02 07:56:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-12-02 07:56:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 07:56:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-12-02 07:56:09,124 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 37 [2024-12-02 07:56:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:09,124 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-12-02 07:56:09,124 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 07:56:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-12-02 07:56:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 07:56:09,124 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:09,125 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:09,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-12-02 07:56:09,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 07:56:09,325 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:09,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1336921024, now seen corresponding path program 2 times [2024-12-02 07:56:09,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:09,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118697303] [2024-12-02 07:56:09,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 07:56:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:09,346 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 07:56:09,346 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 07:56:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 07:56:09,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:09,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118697303] [2024-12-02 07:56:09,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118697303] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:56:09,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:56:09,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 07:56:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955886663] [2024-12-02 07:56:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:56:09,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 07:56:09,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:09,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 07:56:09,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 07:56:09,530 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:09,628 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-12-02 07:56:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 07:56:09,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-12-02 07:56:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:09,629 INFO L225 Difference]: With dead ends: 56 [2024-12-02 07:56:09,629 INFO L226 Difference]: Without dead ends: 56 [2024-12-02 07:56:09,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 07:56:09,629 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:09,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 107 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 07:56:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-12-02 07:56:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-12-02 07:56:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2024-12-02 07:56:09,632 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 41 [2024-12-02 07:56:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:09,632 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2024-12-02 07:56:09,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-12-02 07:56:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-02 07:56:09,632 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:09,633 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:09,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 07:56:09,633 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:09,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1505123640, now seen corresponding path program 1 times [2024-12-02 07:56:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:09,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506115713] [2024-12-02 07:56:09,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:09,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 07:56:09,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:09,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506115713] [2024-12-02 07:56:09,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506115713] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:56:09,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:56:09,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 07:56:09,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452005718] [2024-12-02 07:56:09,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:56:09,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 07:56:09,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:09,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 07:56:09,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 07:56:09,726 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:09,800 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-12-02 07:56:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 07:56:09,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-12-02 07:56:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:09,801 INFO L225 Difference]: With dead ends: 58 [2024-12-02 07:56:09,801 INFO L226 Difference]: Without dead ends: 58 [2024-12-02 07:56:09,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 07:56:09,801 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:09,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 131 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 07:56:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-12-02 07:56:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-12-02 07:56:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 07:56:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-12-02 07:56:09,804 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 42 [2024-12-02 07:56:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:09,804 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-12-02 07:56:09,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2024-12-02 07:56:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 07:56:09,805 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:09,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:09,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 07:56:09,805 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:09,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:09,806 INFO L85 PathProgramCache]: Analyzing trace with hash -982412659, now seen corresponding path program 1 times [2024-12-02 07:56:09,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692906074] [2024-12-02 07:56:09,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-02 07:56:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692906074] [2024-12-02 07:56:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692906074] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 07:56:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 07:56:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 07:56:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731529192] [2024-12-02 07:56:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 07:56:09,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 07:56:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:09,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 07:56:09,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 07:56:09,944 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 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 07:56:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:10,026 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2024-12-02 07:56:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 07:56:10,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 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 44 [2024-12-02 07:56:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:10,027 INFO L225 Difference]: With dead ends: 57 [2024-12-02 07:56:10,027 INFO L226 Difference]: Without dead ends: 57 [2024-12-02 07:56:10,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 07:56:10,028 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:10,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 119 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 07:56:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-12-02 07:56:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-12-02 07:56:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 07:56:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2024-12-02 07:56:10,030 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2024-12-02 07:56:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:10,030 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-12-02 07:56:10,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 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 07:56:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-12-02 07:56:10,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-02 07:56:10,031 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:10,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:10,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 07:56:10,031 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:10,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1148196953, now seen corresponding path program 1 times [2024-12-02 07:56:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:10,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103650375] [2024-12-02 07:56:10,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 07:56:10,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:10,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103650375] [2024-12-02 07:56:10,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103650375] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:10,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796800291] [2024-12-02 07:56:10,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:10,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:10,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:10,927 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:10,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 07:56:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:11,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-12-02 07:56:11,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:11,076 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 07:56:11,104 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 07:56:11,104 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 07:56:11,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 07:56:11,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 07:56:11,207 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 07:56:11,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-12-02 07:56:11,495 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 07:56:11,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-12-02 07:56:11,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:11,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:11,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:11,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-12-02 07:56:11,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:11,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2024-12-02 07:56:11,795 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-12-02 07:56:11,795 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 07:56:11,798 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 07:56:11,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:56:11,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1445 (Array Int Int))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1445 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1445)))) is different from false [2024-12-02 07:56:12,165 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_1 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1444) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_1) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) is different from false [2024-12-02 07:56:12,176 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_1 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1444) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_1) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) is different from false [2024-12-02 07:56:12,194 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_1 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1444) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_1) 4)) 1))) is different from false [2024-12-02 07:56:12,211 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_1 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1444) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_1) 4)) 1) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) is different from false [2024-12-02 07:56:12,222 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_DerPreprocessor_1 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1444) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_1) 4)) 1))) is different from false [2024-12-02 07:56:12,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:12,427 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 61 treesize of output 65 [2024-12-02 07:56:12,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1443))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1444)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_1) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_DerPreprocessor_1 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1443))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1444)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_1) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))))) is different from false [2024-12-02 07:56:12,493 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= (select (store (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1443))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1444)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_1) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int)) (v_DerPreprocessor_1 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1443))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1444)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_DerPreprocessor_1) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))))) is different from false [2024-12-02 07:56:12,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:12,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2024-12-02 07:56:12,511 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 305 treesize of output 285 [2024-12-02 07:56:12,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:12,525 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 210 treesize of output 199 [2024-12-02 07:56:12,535 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 223 treesize of output 217 [2024-12-02 07:56:12,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:12,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 237 [2024-12-02 07:56:12,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:12,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2024-12-02 07:56:12,660 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:12,662 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 60 treesize of output 50 [2024-12-02 07:56:12,665 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:12,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-12-02 07:56:12,670 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:12,684 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-12-02 07:56:12,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 31 [2024-12-02 07:56:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-12-02 07:56:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796800291] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:56:12,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:56:12,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 53 [2024-12-02 07:56:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137270494] [2024-12-02 07:56:12,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:56:12,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-12-02 07:56:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:12,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-12-02 07:56:12,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1882, Unknown=29, NotChecked=760, Total=2862 [2024-12-02 07:56:12,811 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 54 states, 53 states have (on average 2.3207547169811322) internal successors, (123), 54 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 07:56:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:13,968 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-12-02 07:56:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 07:56:13,969 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.3207547169811322) internal successors, (123), 54 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-12-02 07:56:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:13,969 INFO L225 Difference]: With dead ends: 67 [2024-12-02 07:56:13,969 INFO L226 Difference]: Without dead ends: 67 [2024-12-02 07:56:13,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=349, Invalid=2959, Unknown=30, NotChecked=952, Total=4290 [2024-12-02 07:56:13,971 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 474 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:13,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 422 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 969 Invalid, 0 Unknown, 474 Unchecked, 0.5s Time] [2024-12-02 07:56:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-12-02 07:56:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-12-02 07:56:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 59 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 07:56:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-12-02 07:56:13,974 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 47 [2024-12-02 07:56:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:13,974 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-12-02 07:56:13,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.3207547169811322) internal successors, (123), 54 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 07:56:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-12-02 07:56:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-02 07:56:13,975 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:13,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:13,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 07:56:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 07:56:14,175 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1148196952, now seen corresponding path program 1 times [2024-12-02 07:56:14,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065568099] [2024-12-02 07:56:14,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:15,190 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 07:56:15,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:15,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065568099] [2024-12-02 07:56:15,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065568099] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:15,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53265494] [2024-12-02 07:56:15,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:15,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:15,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:15,192 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:15,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 07:56:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:15,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-12-02 07:56:15,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:15,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 07:56:15,360 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 07:56:15,443 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-12-02 07:56:15,444 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 07:56:15,454 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 07:56:15,454 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 07:56:15,502 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 07:56:15,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 07:56:15,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 07:56:15,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-12-02 07:56:15,606 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 07:56:15,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-12-02 07:56:15,611 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 07:56:15,974 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 07:56:15,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-12-02 07:56:15,981 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 07:56:16,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:16,110 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 07:56:16,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:16,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:16,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2024-12-02 07:56:16,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:16,244 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 07:56:16,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:16,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2024-12-02 07:56:16,395 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 07:56:16,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:56:16,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1578 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1578) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (not (= (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1578 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1578)))) (forall ((v_ArrVal_1577 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1577 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1577)) (forall ((v_ArrVal_1578 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1578 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1578)) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1578) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1577) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))))) is different from false [2024-12-02 07:56:18,100 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 0))) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1571 Int) (v_ArrVal_1573 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1571)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1573))) (or (< (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 0) (forall ((v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< 0 (+ (select (store (select (store .cse0 (select (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1576) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_5) 4) 5)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|)))))) (forall ((v_ArrVal_1571 Int) (v_ArrVal_1573 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1571)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1573))) (or (< (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 0) (forall ((v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1574))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (< (+ 7 (select (store (select (store .cse5 .cse6 v_ArrVal_1576) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store .cse7 .cse6 v_ArrVal_1575) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_DerPreprocessor_3) 4))))))))))))) is different from false [2024-12-02 07:56:18,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:18,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 75 [2024-12-02 07:56:18,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:18,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 48 [2024-12-02 07:56:18,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2024-12-02 07:56:18,141 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 255 treesize of output 245 [2024-12-02 07:56:18,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-12-02 07:56:18,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2024-12-02 07:56:18,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:18,166 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 70 treesize of output 72 [2024-12-02 07:56:18,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:18,179 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 50 treesize of output 48 [2024-12-02 07:56:18,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:18,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 129 [2024-12-02 07:56:18,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:18,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 72 [2024-12-02 07:56:18,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:18,260 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 106 treesize of output 92 [2024-12-02 07:56:18,263 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:18,264 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:18,266 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 75 treesize of output 67 [2024-12-02 07:56:18,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:18,272 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 07:56:18,283 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 07:56:18,283 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 95 treesize of output 87 [2024-12-02 07:56:18,288 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:18,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:56:18,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:18,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2024-12-02 07:56:18,585 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 07:56:18,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53265494] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:56:18,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:56:18,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 58 [2024-12-02 07:56:18,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877557864] [2024-12-02 07:56:18,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:56:18,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-12-02 07:56:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:18,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-12-02 07:56:18,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2982, Unknown=18, NotChecked=222, Total=3422 [2024-12-02 07:56:18,587 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 59 states, 58 states have (on average 2.2413793103448274) internal successors, (130), 59 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 07:56:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:20,418 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-12-02 07:56:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-12-02 07:56:20,419 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.2413793103448274) internal successors, (130), 59 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 47 [2024-12-02 07:56:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:20,419 INFO L225 Difference]: With dead ends: 69 [2024-12-02 07:56:20,419 INFO L226 Difference]: Without dead ends: 69 [2024-12-02 07:56:20,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=420, Invalid=4826, Unknown=18, NotChecked=286, Total=5550 [2024-12-02 07:56:20,421 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:20,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 445 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1042 Invalid, 0 Unknown, 114 Unchecked, 0.7s Time] [2024-12-02 07:56:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-12-02 07:56:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-12-02 07:56:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 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 07:56:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-12-02 07:56:20,423 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 47 [2024-12-02 07:56:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:20,423 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-12-02 07:56:20,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.2413793103448274) internal successors, (130), 59 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 07:56:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-12-02 07:56:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-02 07:56:20,423 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:20,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:20,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 07:56:20,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-12-02 07:56:20,624 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:20,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1234364720, now seen corresponding path program 1 times [2024-12-02 07:56:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:20,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827697767] [2024-12-02 07:56:20,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 07:56:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827697767] [2024-12-02 07:56:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827697767] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082409498] [2024-12-02 07:56:21,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:21,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:21,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:21,310 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:21,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 07:56:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:21,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-12-02 07:56:21,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:21,484 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 07:56:21,541 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 07:56:21,541 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 07:56:21,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 07:56:21,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 07:56:21,702 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 07:56:21,702 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 40 treesize of output 37 [2024-12-02 07:56:21,991 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 07:56:21,992 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 40 treesize of output 37 [2024-12-02 07:56:22,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:22,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:22,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:22,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-12-02 07:56:22,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:22,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-12-02 07:56:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 07:56:22,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:56:22,400 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1702 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1702 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1702)))) is different from false [2024-12-02 07:56:22,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_43| Int) (v_DerPreprocessor_6 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1701) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_43| v_DerPreprocessor_6) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_43|))) is different from false [2024-12-02 07:56:22,514 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_43| Int) (v_DerPreprocessor_6 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_43|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1701) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_43| v_DerPreprocessor_6) 4) 0)))) is different from false [2024-12-02 07:56:22,748 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_43| Int) (v_DerPreprocessor_6 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1701) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_43| v_DerPreprocessor_6) 4) 0)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_43|))) is different from false [2024-12-02 07:56:22,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_43| Int) (v_DerPreprocessor_6 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1701) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_43| v_DerPreprocessor_6) 4) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_43|))) is different from false [2024-12-02 07:56:22,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_43| Int) (v_DerPreprocessor_6 Int)) (or (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1700))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1701)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_43| v_DerPreprocessor_6) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_43|))) is different from false [2024-12-02 07:56:22,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:22,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2024-12-02 07:56:22,996 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 181 treesize of output 167 [2024-12-02 07:56:23,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2024-12-02 07:56:23,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:23,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 128 [2024-12-02 07:56:23,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:23,033 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 84 treesize of output 83 [2024-12-02 07:56:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-12-02 07:56:23,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082409498] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:56:23,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:56:23,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 23] total 58 [2024-12-02 07:56:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920673963] [2024-12-02 07:56:23,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:56:23,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-12-02 07:56:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:23,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-12-02 07:56:23,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2424, Unknown=31, NotChecked=630, Total=3306 [2024-12-02 07:56:23,293 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 58 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 58 states have internal predecessors, (126), 0 states have call successors, (0), 0 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 07:56:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:24,584 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-12-02 07:56:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 07:56:24,585 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 58 states have internal predecessors, (126), 0 states have call successors, (0), 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 07:56:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:24,585 INFO L225 Difference]: With dead ends: 71 [2024-12-02 07:56:24,585 INFO L226 Difference]: Without dead ends: 71 [2024-12-02 07:56:24,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=470, Invalid=4339, Unknown=45, NotChecked=846, Total=5700 [2024-12-02 07:56:24,586 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 21 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:24,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 480 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 802 Invalid, 5 Unknown, 332 Unchecked, 0.4s Time] [2024-12-02 07:56:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-12-02 07:56:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2024-12-02 07:56:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 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 07:56:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2024-12-02 07:56:24,588 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 48 [2024-12-02 07:56:24,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:24,588 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-12-02 07:56:24,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 58 states have internal predecessors, (126), 0 states have call successors, (0), 0 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 07:56:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2024-12-02 07:56:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-12-02 07:56:24,589 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:24,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 07:56:24,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 07:56:24,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 07:56:24,789 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:24,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash -815774171, now seen corresponding path program 1 times [2024-12-02 07:56:24,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:24,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576024172] [2024-12-02 07:56:24,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:24,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 07:56:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576024172] [2024-12-02 07:56:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576024172] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474197296] [2024-12-02 07:56:25,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 07:56:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:25,479 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:25,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 07:56:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 07:56:25,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-12-02 07:56:25,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:25,667 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 07:56:25,715 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 07:56:25,715 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 07:56:25,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 07:56:25,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-12-02 07:56:25,795 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 07:56:25,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-12-02 07:56:26,083 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 07:56:26,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-12-02 07:56:26,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:26,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:26,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:26,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-12-02 07:56:26,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:26,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2024-12-02 07:56:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 07:56:26,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:56:26,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1826 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1826) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (not (= v_ArrVal_1826 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1826 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) is different from false [2024-12-02 07:56:26,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_7 Int) (v_ArrVal_1825 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1825) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_DerPreprocessor_7) 4) |c_#StackHeapBarrier|))) is different from false [2024-12-02 07:56:26,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_7 Int) (v_ArrVal_1825 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1825) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_DerPreprocessor_7) 4) |c_#StackHeapBarrier|))) is different from false [2024-12-02 07:56:26,714 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_7 Int) (v_ArrVal_1825 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1825) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_DerPreprocessor_7) 4) |c_#StackHeapBarrier|))) is different from false [2024-12-02 07:56:26,726 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_7 Int) (v_ArrVal_1825 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1825) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_DerPreprocessor_7) 4) |c_#StackHeapBarrier|))) is different from false [2024-12-02 07:56:26,733 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_7 Int) (v_ArrVal_1825 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1825) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_DerPreprocessor_7) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|))) is different from false [2024-12-02 07:56:26,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_7 Int) (v_ArrVal_1825 (Array Int Int))) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1825) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_DerPreprocessor_7) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|))) is different from false [2024-12-02 07:56:26,764 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_7 Int) (v_ArrVal_1825 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_50|) (< (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1824))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1825)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_50| v_DerPreprocessor_7) 4) |c_#StackHeapBarrier|))) is different from false [2024-12-02 07:56:26,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:26,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2024-12-02 07:56:26,875 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 296 treesize of output 276 [2024-12-02 07:56:26,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:26,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 263 treesize of output 253 [2024-12-02 07:56:26,904 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 33 treesize of output 31 [2024-12-02 07:56:26,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:26,912 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 131 treesize of output 123 [2024-12-02 07:56:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-12-02 07:56:27,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474197296] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:56:27,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:56:27,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 52 [2024-12-02 07:56:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932059710] [2024-12-02 07:56:27,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:56:27,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-12-02 07:56:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:56:27,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-12-02 07:56:27,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1787, Unknown=40, NotChecked=744, Total=2756 [2024-12-02 07:56:27,378 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 53 states, 52 states have (on average 2.3653846153846154) internal successors, (123), 53 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 07:56:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 07:56:28,479 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2024-12-02 07:56:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-12-02 07:56:28,479 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.3653846153846154) internal successors, (123), 53 states have internal predecessors, (123), 0 states have call successors, (0), 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 50 [2024-12-02 07:56:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 07:56:28,480 INFO L225 Difference]: With dead ends: 70 [2024-12-02 07:56:28,480 INFO L226 Difference]: Without dead ends: 70 [2024-12-02 07:56:28,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=337, Invalid=2958, Unknown=43, NotChecked=952, Total=4290 [2024-12-02 07:56:28,481 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 448 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 07:56:28,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 622 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1050 Invalid, 0 Unknown, 448 Unchecked, 0.5s Time] [2024-12-02 07:56:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-12-02 07:56:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2024-12-02 07:56:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 62 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 07:56:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2024-12-02 07:56:28,482 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 50 [2024-12-02 07:56:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 07:56:28,482 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2024-12-02 07:56:28,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.3653846153846154) internal successors, (123), 53 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 07:56:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2024-12-02 07:56:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 07:56:28,483 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 07:56:28,483 INFO L218 NwaCegarLoop]: trace histogram [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 07:56:28,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 07:56:28,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 07:56:28,683 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 07:56:28,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 07:56:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1803195121, now seen corresponding path program 2 times [2024-12-02 07:56:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 07:56:28,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773203438] [2024-12-02 07:56:28,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 07:56:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 07:56:28,721 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 07:56:28,721 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 07:56:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:56:30,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 07:56:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773203438] [2024-12-02 07:56:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773203438] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 07:56:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315871094] [2024-12-02 07:56:30,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 07:56:30,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 07:56:30,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 07:56:30,326 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 07:56:30,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 07:56:30,498 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 07:56:30,498 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 07:56:30,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-12-02 07:56:30,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 07:56:30,515 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 07:56:30,533 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 07:56:30,537 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 07:56:30,547 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 07:56:30,551 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 19 treesize of output 18 [2024-12-02 07:56:30,659 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 07:56:30,659 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 07:56:30,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-12-02 07:56:30,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-12-02 07:56:30,734 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 19 treesize of output 18 [2024-12-02 07:56:30,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-12-02 07:56:30,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-12-02 07:56:30,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-12-02 07:56:30,878 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-12-02 07:56:30,879 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 6 case distinctions, treesize of input 103 treesize of output 71 [2024-12-02 07:56:30,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-12-02 07:56:31,364 INFO L349 Elim1Store]: treesize reduction 160, result has 37.7 percent of original size [2024-12-02 07:56:31,365 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 170 [2024-12-02 07:56:31,426 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2024-12-02 07:56:31,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 142 [2024-12-02 07:56:32,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:32,477 INFO L349 Elim1Store]: treesize reduction 128, result has 32.3 percent of original size [2024-12-02 07:56:32,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 224 treesize of output 207 [2024-12-02 07:56:32,521 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-12-02 07:56:32,521 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 161 treesize of output 171 [2024-12-02 07:56:33,702 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 07:56:33,712 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 07:56:33,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:33,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2024-12-02 07:56:33,831 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-02 07:56:33,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:33,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-12-02 07:56:33,846 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-02 07:56:33,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:33,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2024-12-02 07:56:34,042 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-02 07:56:34,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:34,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2024-12-02 07:56:34,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:56:34,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 96 [2024-12-02 07:56:38,384 INFO L349 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2024-12-02 07:56:38,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 41 [2024-12-02 07:56:38,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:56:38,389 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 07:56:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 07:56:38,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 07:57:52,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (forall ((v_ArrVal_1964 (Array Int Int))) (or (not (= v_ArrVal_1964 (store .cse0 .cse1 (select v_ArrVal_1964 .cse1)))) (forall ((v_ArrVal_1965 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse1 (select v_ArrVal_1965 .cse1)) v_ArrVal_1965)) (forall ((v_ArrVal_1967 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1965) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1967) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1964) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 4) 0)))))) (forall ((v_ArrVal_1964 (Array Int Int))) (or (not (= v_ArrVal_1964 (store .cse0 .cse1 (select v_ArrVal_1964 .cse1)))) (forall ((v_ArrVal_1966 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1964))) (or (not (= (store (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1966 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)) v_ArrVal_1966)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1966) (select v_ArrVal_1966 4)) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))))))))) is different from false [2024-12-02 07:57:57,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (forall ((v_ArrVal_1964 (Array Int Int))) (or (forall ((v_ArrVal_1966 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1964))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1966) (select v_ArrVal_1966 4)) 4) 0) (not (= v_ArrVal_1966 (store (select .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1966 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)))) (not (= (store .cse2 .cse3 (select v_ArrVal_1964 .cse3)) v_ArrVal_1964)))) (forall ((v_ArrVal_1964 (Array Int Int))) (or (forall ((v_ArrVal_1965 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse3 (select v_ArrVal_1965 .cse3)) v_ArrVal_1965)) (forall ((v_ArrVal_1967 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1965) |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1967) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 4) 0)))) (not (= (store .cse2 .cse3 (select v_ArrVal_1964 .cse3)) v_ArrVal_1964))))))) is different from false [2024-12-02 07:58:02,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (forall ((v_ArrVal_1964 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1964 .cse1)) v_ArrVal_1964)) (forall ((v_ArrVal_1965 (Array Int Int))) (or (forall ((v_ArrVal_1967 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1965) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1967) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4) 0)) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse1 (select v_ArrVal_1965 .cse1)) v_ArrVal_1965)))))) (forall ((v_ArrVal_1964 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1964 .cse1)) v_ArrVal_1964)) (forall ((v_ArrVal_1966 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1964))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1966) (select v_ArrVal_1966 4)) 4) 0) (not (= v_ArrVal_1966 (store (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1966 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))))))))) is different from false [2024-12-02 07:58:06,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (forall ((v_ArrVal_1964 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1964 .cse1)) v_ArrVal_1964)) (forall ((v_ArrVal_1965 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse1 (select v_ArrVal_1965 .cse1)) v_ArrVal_1965)) (forall ((v_ArrVal_1967 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1965) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1967) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0)))))) (forall ((v_ArrVal_1964 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1964 .cse1)) v_ArrVal_1964)) (forall ((v_ArrVal_1966 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1964))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1966) (select v_ArrVal_1966 4)) 4) 0) (not (= v_ArrVal_1966 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1966 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))))))))) is different from false [2024-12-02 07:58:11,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1961 Int) (v_ArrVal_1963 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse6 .cse4 v_ArrVal_1963)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= v_ArrVal_1964 (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_1961)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1964 .cse2))))) (forall ((v_ArrVal_1966 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (let ((.cse5 (store .cse0 .cse1 v_ArrVal_1964))) (or (= (select (select (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1966) (select v_ArrVal_1966 4)) 4) 0) (not (= (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1966 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)) v_ArrVal_1966)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)))))))) (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1961 Int) (v_ArrVal_1963 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse6 .cse4 v_ArrVal_1963))) (.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_1961)))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse8 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= v_ArrVal_1964 (store (select .cse7 .cse8) .cse9 (select v_ArrVal_1964 .cse9)))) (forall ((v_ArrVal_1965 (Array Int Int))) (or (not (= v_ArrVal_1965 (store (select .cse10 .cse8) .cse9 (select v_ArrVal_1965 .cse9)))) (forall ((v_ArrVal_1967 (Array Int Int))) (= (select (select (store (store .cse10 .cse8 v_ArrVal_1965) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1967) (select (select (store .cse7 .cse8 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0)))))))))) is different from false [2024-12-02 07:58:16,366 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 0)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1957 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1961 Int) (v_ArrVal_1963 Int)) (let ((.cse0 (store .cse9 .cse5 v_ArrVal_1963))) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (forall ((v_ArrVal_1966 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) .cse1 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1966) (select v_ArrVal_1966 4)) 4) 0) (not (= (store (select (store .cse2 .cse1 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1966 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)) v_ArrVal_1966)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))) (not (= v_ArrVal_1964 (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse6 .cse7 v_ArrVal_1957)))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_1961))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store (select .cse2 .cse1) .cse3 (select v_ArrVal_1964 .cse3)))))))))) (forall ((v_ArrVal_1957 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1961 Int) (v_ArrVal_1963 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse6 .cse7 v_ArrVal_1957)))) (let ((.cse10 (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_1961))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse10)) (.cse12 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse5 v_ArrVal_1963)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse14 (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (forall ((v_ArrVal_1965 (Array Int Int))) (or (forall ((v_ArrVal_1967 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse10) .cse11 v_ArrVal_1965) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1967) (select (select (store .cse12 .cse11 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0)) (not (= v_ArrVal_1965 (store (select .cse13 .cse11) .cse14 (select v_ArrVal_1965 .cse14)))))) (not (= v_ArrVal_1964 (store (select .cse12 .cse11) .cse14 (select v_ArrVal_1964 .cse14)))))))))))))) is different from false [2024-12-02 07:58:20,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse6 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 0)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse5 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1957 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1961 Int) (v_ArrVal_1963 Int)) (let ((.cse7 (store .cse9 .cse4 v_ArrVal_1963))) (let ((.cse0 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse7))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (let ((.cse2 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse6 v_ArrVal_1957)))) (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_1961))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1964 .cse2))) v_ArrVal_1964)) (forall ((v_ArrVal_1966 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (not (= (store (select (store .cse0 .cse1 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1966 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)) v_ArrVal_1966)) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse7) .cse1 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1966) (select v_ArrVal_1966 4)) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)))))))) (forall ((v_ArrVal_1957 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1961 Int) (v_ArrVal_1963 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse6 v_ArrVal_1957)))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_1961))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse4 v_ArrVal_1963))) (.cse13 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse14))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (store (select .cse10 .cse11) .cse12 (select v_ArrVal_1964 .cse12)) v_ArrVal_1964)) (forall ((v_ArrVal_1965 (Array Int Int))) (or (not (= v_ArrVal_1965 (store (select .cse13 .cse11) .cse12 (select v_ArrVal_1965 .cse12)))) (forall ((v_ArrVal_1967 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse14) .cse11 v_ArrVal_1965) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1967) (select (select (store .cse10 .cse11 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0)))))))))))))) is different from false [2024-12-02 07:58:20,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:58:20,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 494 treesize of output 400 [2024-12-02 07:58:21,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:58:21,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 384 treesize of output 280 [2024-12-02 07:58:21,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:58:21,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 144 [2024-12-02 07:58:21,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:58:21,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 296 treesize of output 202 [2024-12-02 07:58:22,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1967 (Array Int Int)) (v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1961 Int) (v_ArrVal_1963 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_13))) (let ((.cse6 (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_1961))) (let ((.cse1 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_14))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_1963)))) (.cse4 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse6))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_14 .cse0) 0)) (not (= (store (select .cse1 .cse2) .cse3 (select v_ArrVal_1964 .cse3)) v_ArrVal_1964)) (not (= (store (select .cse4 .cse2) .cse3 (select v_ArrVal_1965 .cse3)) v_ArrVal_1965)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse5))) (not (= (select v_arrayElimArr_14 .cse5) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse6) .cse2 v_ArrVal_1965) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1967) (select (select (store .cse1 .cse2 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0))))))) (forall ((v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1961 Int) (v_ArrVal_1963 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_16))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_1963))) (let ((.cse10 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse14))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_16 .cse5) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_16 .cse0) 0)) (not (= v_ArrVal_1966 (store (select (store .cse10 .cse11 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1966 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)))) (not (= (let ((.cse12 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_15))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_1961))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store (select .cse10 .cse11) .cse12 (select v_ArrVal_1964 .cse12))) v_ArrVal_1964)) (= 0 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse14) .cse11 v_ArrVal_1964) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1966) (select v_ArrVal_1966 4)) 4)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_15 .cse5))))))))))) is different from false [2024-12-02 07:58:36,131 INFO L349 Elim1Store]: treesize reduction 418, result has 44.3 percent of original size [2024-12-02 07:58:36,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 2562 treesize of output 2520 [2024-12-02 07:58:36,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:58:36,787 INFO L349 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2024-12-02 07:58:36,788 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 6170 treesize of output 4258 [2024-12-02 07:58:37,341 INFO L349 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2024-12-02 07:58:37,342 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 2650 treesize of output 2573 [2024-12-02 07:58:37,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:58:37,837 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 1350 treesize of output 1329 [2024-12-02 07:58:39,306 INFO L349 Elim1Store]: treesize reduction 147, result has 36.4 percent of original size [2024-12-02 07:58:39,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 941 treesize of output 1049 [2024-12-02 07:58:39,705 INFO L224 Elim1Store]: Index analysis took 217 ms [2024-12-02 07:58:41,438 INFO L349 Elim1Store]: treesize reduction 200, result has 32.7 percent of original size [2024-12-02 07:58:41,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 2198 treesize of output 2220 [2024-12-02 07:58:42,558 INFO L224 Elim1Store]: Index analysis took 756 ms [2024-12-02 07:58:44,651 INFO L349 Elim1Store]: treesize reduction 297, result has 10.0 percent of original size [2024-12-02 07:58:44,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 90 treesize of output 139 [2024-12-02 07:58:45,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 439 treesize of output 431 [2024-12-02 07:58:47,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:58:47,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-12-02 07:58:47,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:58:47,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 146 [2024-12-02 07:58:47,944 INFO L224 Elim1Store]: Index analysis took 110 ms [2024-12-02 07:58:48,658 INFO L349 Elim1Store]: treesize reduction 52, result has 49.0 percent of original size [2024-12-02 07:58:48,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 199 treesize of output 227 [2024-12-02 07:58:48,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 12 treesize of output 8 [2024-12-02 07:58:49,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:58:49,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2024-12-02 07:58:50,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:58:50,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 21 [2024-12-02 07:58:53,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-12-02 07:58:54,518 INFO L224 Elim1Store]: Index analysis took 251 ms [2024-12-02 07:58:55,177 INFO L349 Elim1Store]: treesize reduction 89, result has 37.8 percent of original size [2024-12-02 07:58:55,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 589 treesize of output 639 [2024-12-02 07:58:56,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:58:56,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:58:56,326 INFO L224 Elim1Store]: Index analysis took 154 ms [2024-12-02 07:58:56,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 17 [2024-12-02 07:58:57,402 INFO L224 Elim1Store]: Index analysis took 225 ms [2024-12-02 07:58:57,442 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-12-02 07:58:57,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 19 [2024-12-02 07:58:58,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-12-02 07:58:58,636 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:58:58,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:58:58,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:58:58,886 INFO L224 Elim1Store]: Index analysis took 116 ms [2024-12-02 07:58:59,413 INFO L349 Elim1Store]: treesize reduction 61, result has 27.4 percent of original size [2024-12-02 07:58:59,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 1417 treesize of output 1393 [2024-12-02 07:58:59,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:58:59,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:58:59,770 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:58:59,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:58:59,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:58:59,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 67 [2024-12-02 07:59:00,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:00,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:59:00,276 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:00,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:59:00,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:59:00,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 67 [2024-12-02 07:59:00,875 INFO L224 Elim1Store]: Index analysis took 279 ms [2024-12-02 07:59:01,937 INFO L349 Elim1Store]: treesize reduction 181, result has 17.4 percent of original size [2024-12-02 07:59:01,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 291 treesize of output 293 [2024-12-02 07:59:02,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:02,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2024-12-02 07:59:03,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-12-02 07:59:03,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 466 treesize of output 456 [2024-12-02 07:59:04,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 71 [2024-12-02 07:59:05,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-12-02 07:59:05,674 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-12-02 07:59:05,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 107 [2024-12-02 07:59:08,714 INFO L349 Elim1Store]: treesize reduction 52, result has 72.2 percent of original size [2024-12-02 07:59:08,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 25 case distinctions, treesize of input 1254 treesize of output 1142 [2024-12-02 07:59:13,853 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 439 treesize of output 431 [2024-12-02 07:59:15,089 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-12-02 07:59:15,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:15,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 146 [2024-12-02 07:59:15,436 INFO L224 Elim1Store]: Index analysis took 128 ms [2024-12-02 07:59:16,130 INFO L349 Elim1Store]: treesize reduction 60, result has 41.2 percent of original size [2024-12-02 07:59:16,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 199 treesize of output 219 [2024-12-02 07:59:16,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-12-02 07:59:17,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:17,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 21 [2024-12-02 07:59:18,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:18,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 180 [2024-12-02 07:59:19,306 INFO L224 Elim1Store]: Index analysis took 168 ms [2024-12-02 07:59:20,129 INFO L349 Elim1Store]: treesize reduction 202, result has 24.3 percent of original size [2024-12-02 07:59:20,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 368 treesize of output 379 [2024-12-02 07:59:20,965 INFO L224 Elim1Store]: Index analysis took 222 ms [2024-12-02 07:59:21,065 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2024-12-02 07:59:21,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 27 [2024-12-02 07:59:22,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:22,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 457 treesize of output 467 [2024-12-02 07:59:22,778 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-12-02 07:59:22,780 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 15696 treesize of output 11782 [2024-12-02 07:59:23,371 INFO L224 Elim1Store]: Index analysis took 154 ms [2024-12-02 07:59:23,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:23,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3832 treesize of output 3410 [2024-12-02 07:59:24,639 INFO L224 Elim1Store]: Index analysis took 596 ms [2024-12-02 07:59:28,046 INFO L349 Elim1Store]: treesize reduction 24, result has 87.3 percent of original size [2024-12-02 07:59:28,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 972 treesize of output 1094 [2024-12-02 07:59:33,376 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 439 treesize of output 431 [2024-12-02 07:59:34,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:34,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 146 [2024-12-02 07:59:35,128 INFO L224 Elim1Store]: Index analysis took 115 ms [2024-12-02 07:59:35,796 INFO L349 Elim1Store]: treesize reduction 60, result has 41.2 percent of original size [2024-12-02 07:59:35,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 199 treesize of output 219 [2024-12-02 07:59:35,859 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-12-02 07:59:35,888 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-12-02 07:59:36,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-12-02 07:59:37,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:37,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 21 [2024-12-02 07:59:38,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:59:38,031 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:38,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:59:38,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:59:38,222 INFO L224 Elim1Store]: Index analysis took 121 ms [2024-12-02 07:59:38,971 INFO L349 Elim1Store]: treesize reduction 167, result has 14.8 percent of original size [2024-12-02 07:59:38,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 271 treesize of output 324 [2024-12-02 07:59:39,223 INFO L224 Elim1Store]: Index analysis took 192 ms [2024-12-02 07:59:40,337 INFO L349 Elim1Store]: treesize reduction 10, result has 85.9 percent of original size [2024-12-02 07:59:40,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 181 treesize of output 205 [2024-12-02 07:59:43,656 INFO L349 Elim1Store]: treesize reduction 813, result has 8.3 percent of original size [2024-12-02 07:59:43,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 41 case distinctions, treesize of input 1287 treesize of output 1056 [2024-12-02 07:59:44,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:44,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 500 treesize of output 494 [2024-12-02 07:59:45,332 INFO L349 Elim1Store]: treesize reduction 50, result has 28.6 percent of original size [2024-12-02 07:59:45,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 118 [2024-12-02 07:59:45,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 494 treesize of output 486 [2024-12-02 07:59:45,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:45,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2024-12-02 07:59:47,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:47,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:47,567 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:47,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:59:48,231 INFO L349 Elim1Store]: treesize reduction 67, result has 38.5 percent of original size [2024-12-02 07:59:48,232 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 1572 treesize of output 1430 [2024-12-02 07:59:48,272 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:48,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 07:59:48,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 130 [2024-12-02 07:59:48,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:48,550 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:48,577 INFO L224 Elim1Store]: Index analysis took 164 ms [2024-12-02 07:59:49,820 INFO L349 Elim1Store]: treesize reduction 86, result has 49.1 percent of original size [2024-12-02 07:59:49,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 466 treesize of output 513 [2024-12-02 07:59:49,882 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 205 treesize of output 189 [2024-12-02 07:59:49,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:49,945 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:50,112 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-12-02 07:59:50,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 242 treesize of output 237 [2024-12-02 07:59:50,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:50,698 INFO L224 Elim1Store]: Index analysis took 161 ms [2024-12-02 07:59:51,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 07:59:51,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 107 [2024-12-02 07:59:51,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:51,236 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 07:59:51,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-12-02 07:59:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-12-02 07:59:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315871094] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 07:59:54,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 07:59:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 31] total 71 [2024-12-02 07:59:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533842617] [2024-12-02 07:59:54,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 07:59:54,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-12-02 07:59:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 07:59:54,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-12-02 07:59:54,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3649, Unknown=32, NotChecked=1032, Total=4970 [2024-12-02 07:59:54,244 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 71 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 71 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 08:00:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:00:52,310 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2024-12-02 08:00:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 08:00:52,311 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 71 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 53 [2024-12-02 08:00:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:00:52,312 INFO L225 Difference]: With dead ends: 107 [2024-12-02 08:00:52,312 INFO L226 Difference]: Without dead ends: 107 [2024-12-02 08:00:52,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 147.6s TimeCoverageRelationStatistics Valid=436, Invalid=6202, Unknown=36, NotChecked=1336, Total=8010 [2024-12-02 08:00:52,314 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 497 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:00:52,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 962 Invalid, 2051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1536 Invalid, 0 Unknown, 497 Unchecked, 20.9s Time] [2024-12-02 08:00:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-12-02 08:00:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-12-02 08:00:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0909090909090908) internal successors, (108), 103 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 08:00:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2024-12-02 08:00:52,317 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 53 [2024-12-02 08:00:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:00:52,317 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2024-12-02 08:00:52,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 71 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 08:00:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2024-12-02 08:00:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 08:00:52,318 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:00:52,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:00:52,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-12-02 08:00:52,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 08:00:52,518 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 08:00:52,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:00:52,519 INFO L85 PathProgramCache]: Analyzing trace with hash -64471448, now seen corresponding path program 2 times [2024-12-02 08:00:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:00:52,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104811840] [2024-12-02 08:00:52,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 08:00:52,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:00:52,542 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 08:00:52,542 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 08:01:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 08:01:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:01:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104811840] [2024-12-02 08:01:00,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104811840] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:01:00,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911603281] [2024-12-02 08:01:00,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 08:01:00,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:01:00,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:01:00,140 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:01:00,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 08:01:00,332 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 08:01:00,332 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 08:01:00,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-12-02 08:01:00,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:01:01,784 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-12-02 08:01:01,784 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 08:01:02,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 08:01:03,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 08:01:04,488 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-12-02 08:01:04,488 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 54 treesize of output 49 [2024-12-02 08:01:11,129 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-12-02 08:01:11,129 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 58 treesize of output 57 [2024-12-02 08:01:11,473 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-12-02 08:01:11,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2024-12-02 08:01:15,490 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-12-02 08:01:15,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 77 [2024-12-02 08:01:25,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 08:01:25,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 171 [2024-12-02 08:01:37,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2024-12-02 08:01:39,436 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-12-02 08:01:39,436 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 4 case distinctions, treesize of input 26 treesize of output 44 [2024-12-02 08:01:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:01:40,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:01:50,267 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2093 (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_2093) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-12-02 08:01:50,347 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2093 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) v_ArrVal_2093) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-12-02 08:01:50,400 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2093 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) v_ArrVal_2093) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-12-02 08:01:50,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2093 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_dll_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_dll_create_~new_head~0#1.base|) 4) v_ArrVal_2093) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from false [2024-12-02 08:01:50,533 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2092 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2092))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) v_ArrVal_2093)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-12-02 08:01:50,618 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2092 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2092))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) v_ArrVal_2093)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from false [2024-12-02 08:01:50,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 08:01:50,745 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 2 case distinctions, treesize of input 60 treesize of output 51 [2024-12-02 08:01:50,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 08:01:50,962 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 328 treesize of output 302 [2024-12-02 08:01:50,997 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 235 treesize of output 223 [2024-12-02 08:01:51,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 215 [2024-12-02 08:02:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2024-12-02 08:02:14,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911603281] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 08:02:14,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 08:02:14,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 22] total 58 [2024-12-02 08:02:14,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064895953] [2024-12-02 08:02:14,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 08:02:14,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-12-02 08:02:14,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:02:14,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-12-02 08:02:14,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2577, Unknown=11, NotChecked=642, Total=3422 [2024-12-02 08:02:14,318 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 59 states, 58 states have (on average 2.4827586206896552) internal successors, (144), 59 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 08:02:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:02:42,810 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2024-12-02 08:02:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 08:02:42,811 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.4827586206896552) internal successors, (144), 59 states have internal predecessors, (144), 0 states have call successors, (0), 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 54 [2024-12-02 08:02:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:02:42,811 INFO L225 Difference]: With dead ends: 107 [2024-12-02 08:02:42,811 INFO L226 Difference]: Without dead ends: 73 [2024-12-02 08:02:42,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=295, Invalid=3878, Unknown=11, NotChecked=786, Total=4970 [2024-12-02 08:02:42,812 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-12-02 08:02:42,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 663 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1057 Invalid, 0 Unknown, 391 Unchecked, 14.7s Time] [2024-12-02 08:02:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-12-02 08:02:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-12-02 08:02:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 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 08:02:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2024-12-02 08:02:42,815 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 54 [2024-12-02 08:02:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:02:42,815 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2024-12-02 08:02:42,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.4827586206896552) internal successors, (144), 59 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 08:02:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-12-02 08:02:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 08:02:42,816 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:02:42,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:02:42,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-12-02 08:02:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 08:02:43,016 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-12-02 08:02:43,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:02:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2136856022, now seen corresponding path program 3 times [2024-12-02 08:02:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:02:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116389489] [2024-12-02 08:02:43,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 08:02:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:02:43,058 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-12-02 08:02:43,058 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 08:02:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 08:02:43,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:02:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116389489] [2024-12-02 08:02:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116389489] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:02:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202688023] [2024-12-02 08:02:43,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 08:02:43,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:02:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:02:43,437 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:02:43,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 08:02:43,964 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-12-02 08:02:43,964 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 08:02:43,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 08:02:43,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:02:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 08:02:44,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:02:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202688023] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:02:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 08:02:44,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-12-02 08:02:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787177037] [2024-12-02 08:02:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:02:44,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:02:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:02:44,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:02:44,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:02:44,545 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 08:02:44,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:02:44,656 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-12-02 08:02:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:02:44,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 62 [2024-12-02 08:02:44,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:02:44,657 INFO L225 Difference]: With dead ends: 20 [2024-12-02 08:02:44,657 INFO L226 Difference]: Without dead ends: 0 [2024-12-02 08:02:44,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:02:44,657 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 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.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:02:44,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 08:02:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-12-02 08:02:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-12-02 08:02:44,658 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 08:02:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-12-02 08:02:44,658 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2024-12-02 08:02:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:02:44,658 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-12-02 08:02:44,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 08:02:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-12-02 08:02:44,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-02 08:02:44,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2024-12-02 08:02:44,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-12-02 08:02:44,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-12-02 08:02:44,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-12-02 08:02:44,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2024-12-02 08:02:44,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2024-12-02 08:02:44,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2024-12-02 08:02:44,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2024-12-02 08:02:44,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2024-12-02 08:02:44,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2024-12-02 08:02:44,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2024-12-02 08:02:44,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2024-12-02 08:02:44,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (1 of 23 remaining) [2024-12-02 08:02:44,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2024-12-02 08:02:44,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-12-02 08:02:44,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 08:02:44,866 INFO L422 BasicCegarLoop]: Path program histogram: [3, 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 08:02:44,868 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 08:02:44,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:02:44 BoogieIcfgContainer [2024-12-02 08:02:44,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 08:02:44,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 08:02:44,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 08:02:44,872 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 08:02:44,873 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:55:56" (3/4) ... [2024-12-02 08:02:44,874 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-02 08:02:44,878 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2024-12-02 08:02:44,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-12-02 08:02:44,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-12-02 08:02:44,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-02 08:02:44,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-02 08:02:44,956 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 08:02:44,956 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 08:02:44,956 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 08:02:44,957 INFO L158 Benchmark]: Toolchain (without parser) took 408972.49ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 118.3MB in the beginning and 57.9MB in the end (delta: 60.3MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2024-12-02 08:02:44,957 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:02:44,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.78ms. Allocated memory is still 142.6MB. Free memory was 118.1MB in the beginning and 100.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 08:02:44,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.45ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:02:44,957 INFO L158 Benchmark]: Boogie Preprocessor took 45.39ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:02:44,958 INFO L158 Benchmark]: RCFGBuilder took 379.04ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 77.8MB in the end (delta: 18.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 08:02:44,958 INFO L158 Benchmark]: TraceAbstraction took 408084.63ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 77.2MB in the beginning and 63.4MB in the end (delta: 13.7MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2024-12-02 08:02:44,958 INFO L158 Benchmark]: Witness Printer took 84.29ms. Allocated memory is still 167.8MB. Free memory was 63.4MB in the beginning and 57.9MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:02:44,959 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.36ms. Allocated memory is still 142.6MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.78ms. Allocated memory is still 142.6MB. Free memory was 118.1MB in the beginning and 100.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.45ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.39ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 379.04ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 77.8MB in the end (delta: 18.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 408084.63ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 77.2MB in the beginning and 63.4MB in the end (delta: 13.7MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * Witness Printer took 84.29ms. Allocated memory is still 167.8MB. Free memory was 63.4MB in the beginning and 57.9MB in the end (delta: 5.5MB). There was no memory consumed. 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: -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: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 606]: 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: 624]: 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 2 procedures, 72 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 408.0s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 95.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 848 SdHoareTripleChecker+Valid, 39.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 848 mSDsluCounter, 7213 SdHoareTripleChecker+Invalid, 38.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2428 IncrementalHoareTripleChecker+Unchecked, 6171 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8974 IncrementalHoareTripleChecker+Invalid, 11565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 1042 mSDtfsCounter, 8974 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1594 GetRequests, 921 SyntacticMatches, 42 SemanticMatches, 631 ConstructedPredicates, 42 IntricatePredicates, 0 DeprecatedPredicates, 7185 ImplicationChecksByTransitivity, 221.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=26, InterpolantAutomatonStates: 290, 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, 28 MinimizatonAttempts, 80 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 305.5s InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2011 ConstructedInterpolants, 226 QuantifiedInterpolants, 43443 SizeOfPredicates, 69 NumberOfNonLiveVariables, 4936 ConjunctsInSsa, 598 ConjunctsInUnsatCore, 60 InterpolantComputations, 14 PerfectInterpolantSequences, 414/914 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 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-12-02 08:02:45,169 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-12-02 08:02:45,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa46dfd8-e6f1-4ecf-8e6d-290a55e43681/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE