./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_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/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_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB --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-11-28 04:11:16,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:11:16,618 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:11:16,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:11:16,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:11:16,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:11:16,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:11:16,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:11:16,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:11:16,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:11:16,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:11:16,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:11:16,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:11:16,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:11:16,673 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:11:16,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:11:16,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:11:16,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:11:16,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:11:16,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:11:16,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:11:16,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:11:16,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:11:16,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:11:16,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:11:16,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:11:16,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:11:16,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:11:16,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:11:16,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:11:16,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:11:16,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:11:16,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:11:16,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:11:16,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:11:16,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:11:16,676 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_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB 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-11-28 04:11:17,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:11:17,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:11:17,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:11:17,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:11:17,048 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:11:17,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2024-11-28 04:11:20,175 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/data/880fc5c0b/162fefb652c54da1bdd3bb7b76f9a307/FLAGf5ec61fbb [2024-11-28 04:11:20,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:11:20,541 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2024-11-28 04:11:20,555 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/data/880fc5c0b/162fefb652c54da1bdd3bb7b76f9a307/FLAGf5ec61fbb [2024-11-28 04:11:20,572 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/data/880fc5c0b/162fefb652c54da1bdd3bb7b76f9a307 [2024-11-28 04:11:20,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:11:20,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:11:20,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:11:20,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:11:20,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:11:20,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:11:20" (1/1) ... [2024-11-28 04:11:20,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eee904f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:20, skipping insertion in model container [2024-11-28 04:11:20,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:11:20" (1/1) ... [2024-11-28 04:11:20,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:11:21,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:11:21,043 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:11:21,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:11:21,156 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:11:21,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21 WrapperNode [2024-11-28 04:11:21,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:11:21,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:11:21,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:11:21,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:11:21,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,229 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2024-11-28 04:11:21,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:11:21,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:11:21,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:11:21,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:11:21,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,282 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-11-28 04:11:21,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:11:21,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:11:21,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:11:21,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:11:21,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (1/1) ... [2024-11-28 04:11:21,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:11:21,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:21,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:11:21,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:11:21,380 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 04:11:21,380 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 04:11:21,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:11:21,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:11:21,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:11:21,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:11:21,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:11:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:11:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:11:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:11:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:11:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:11:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:11:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:11:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:11:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:11:21,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:11:21,566 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:11:21,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:11:21,599 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 04:11:22,027 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-28 04:11:22,027 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:11:22,049 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:11:22,049 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 04:11:22,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:11:22 BoogieIcfgContainer [2024-11-28 04:11:22,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:11:22,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:11:22,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:11:22,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:11:22,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:11:20" (1/3) ... [2024-11-28 04:11:22,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90e2b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:11:22, skipping insertion in model container [2024-11-28 04:11:22,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:11:21" (2/3) ... [2024-11-28 04:11:22,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90e2b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:11:22, skipping insertion in model container [2024-11-28 04:11:22,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:11:22" (3/3) ... [2024-11-28 04:11:22,070 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2024-11-28 04:11:22,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:11:22,095 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-11-28 04:11:22,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:11:22,191 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;@51dcab4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:11:22,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-28 04:11:22,197 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-11-28 04:11:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:11:22,207 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:22,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:11:22,209 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-11-28 04:11:22,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518442, now seen corresponding path program 1 times [2024-11-28 04:11:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:22,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844231146] [2024-11-28 04:11:22,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844231146] [2024-11-28 04:11:22,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844231146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:22,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:22,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:11:22,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348381368] [2024-11-28 04:11:22,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:22,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:11:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:22,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:11:22,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:11:22,600 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-11-28 04:11:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:22,740 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-11-28 04:11:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:11:22,743 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-11-28 04:11:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:22,753 INFO L225 Difference]: With dead ends: 67 [2024-11-28 04:11:22,753 INFO L226 Difference]: Without dead ends: 62 [2024-11-28 04:11:22,756 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-11-28 04:11:22,760 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-28 04:11:22,764 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-11-28 04:11:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-28 04:11:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-28 04:11:22,794 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-11-28 04:11:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-28 04:11:22,800 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 6 [2024-11-28 04:11:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:22,800 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-28 04:11:22,800 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-11-28 04:11:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-28 04:11:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:11:22,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:22,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:11:22,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:11:22,802 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-11-28 04:11:22,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:22,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518443, now seen corresponding path program 1 times [2024-11-28 04:11:22,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:22,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343752915] [2024-11-28 04:11:22,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:22,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:22,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:22,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343752915] [2024-11-28 04:11:22,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343752915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:22,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:22,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:11:22,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969934963] [2024-11-28 04:11:22,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:22,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:11:22,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:22,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:11:22,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:11:22,963 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-11-28 04:11:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:23,037 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-11-28 04:11:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:11:23,038 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-11-28 04:11:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:23,039 INFO L225 Difference]: With dead ends: 59 [2024-11-28 04:11:23,039 INFO L226 Difference]: Without dead ends: 59 [2024-11-28 04:11:23,039 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-11-28 04:11:23,040 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:11:23,041 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.1s Time] [2024-11-28 04:11:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-28 04:11:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-28 04:11:23,054 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-11-28 04:11:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-28 04:11:23,058 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 6 [2024-11-28 04:11:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:23,058 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-28 04:11:23,058 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-11-28 04:11:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-28 04:11:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:11:23,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:23,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:11:23,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:11:23,060 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-11-28 04:11:23,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:23,062 INFO L85 PathProgramCache]: Analyzing trace with hash 491092471, now seen corresponding path program 1 times [2024-11-28 04:11:23,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:23,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030440723] [2024-11-28 04:11:23,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:23,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030440723] [2024-11-28 04:11:23,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030440723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:23,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:23,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:11:23,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144292645] [2024-11-28 04:11:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:23,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:11:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:23,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:11:23,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:11:23,204 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-11-28 04:11:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:23,228 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-28 04:11:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:11:23,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 04:11:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:23,230 INFO L225 Difference]: With dead ends: 70 [2024-11-28 04:11:23,232 INFO L226 Difference]: Without dead ends: 70 [2024-11-28 04:11:23,233 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-11-28 04:11:23,234 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-11-28 04:11:23,234 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-11-28 04:11:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-28 04:11:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-28 04:11:23,245 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-11-28 04:11:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-11-28 04:11:23,248 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 9 [2024-11-28 04:11:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:23,249 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-11-28 04:11:23,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:11:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-11-28 04:11:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:11:23,250 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:23,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:11:23,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:11:23,250 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-11-28 04:11:23,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1519983918, now seen corresponding path program 1 times [2024-11-28 04:11:23,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:23,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616515095] [2024-11-28 04:11:23,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:23,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:23,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:23,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616515095] [2024-11-28 04:11:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616515095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:23,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:23,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:11:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73054119] [2024-11-28 04:11:23,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:23,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:11:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:23,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:11:23,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:11:23,396 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-11-28 04:11:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:23,446 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-28 04:11:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:11:23,447 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-11-28 04:11:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:23,448 INFO L225 Difference]: With dead ends: 66 [2024-11-28 04:11:23,448 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 04:11:23,448 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-11-28 04:11:23,449 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-11-28 04:11:23,450 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-11-28 04:11:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 04:11:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 04:11:23,462 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-11-28 04:11:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-28 04:11:23,467 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 10 [2024-11-28 04:11:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:23,467 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-28 04:11:23,468 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-11-28 04:11:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-28 04:11:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:11:23,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:23,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:11:23,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:11:23,469 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-11-28 04:11:23,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1123286484, now seen corresponding path program 1 times [2024-11-28 04:11:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:23,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864280614] [2024-11-28 04:11:23,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:23,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:23,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864280614] [2024-11-28 04:11:23,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864280614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323330135] [2024-11-28 04:11:23,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:23,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:23,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:11:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:23,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:11:23,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:23,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:23,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323330135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:23,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:23,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 04:11:23,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896796280] [2024-11-28 04:11:23,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:23,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:11:23,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:23,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:11:23,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:11:23,970 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-11-28 04:11:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:24,048 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-28 04:11:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:11:24,049 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-11-28 04:11:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:24,049 INFO L225 Difference]: With dead ends: 68 [2024-11-28 04:11:24,049 INFO L226 Difference]: Without dead ends: 68 [2024-11-28 04:11:24,050 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-11-28 04:11:24,051 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-11-28 04:11:24,051 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-11-28 04:11:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-28 04:11:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-28 04:11:24,059 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-11-28 04:11:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-11-28 04:11:24,060 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 17 [2024-11-28 04:11:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:24,061 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-11-28 04:11:24,061 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-11-28 04:11:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-11-28 04:11:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 04:11:24,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:24,062 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 04:11:24,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:11:24,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:24,262 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-11-28 04:11:24,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123431, now seen corresponding path program 1 times [2024-11-28 04:11:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821215618] [2024-11-28 04:11:24,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:24,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:24,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:24,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821215618] [2024-11-28 04:11:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821215618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503609043] [2024-11-28 04:11:24,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:24,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:24,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:24,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:24,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:11:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:24,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:11:24,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:24,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:11:24,880 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:11:24,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 04:11:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:24,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503609043] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:25,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:25,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-28 04:11:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870781893] [2024-11-28 04:11:25,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:25,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:11:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:25,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:11:25,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:11:25,006 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-11-28 04:11:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:25,167 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-28 04:11:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:11:25,168 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-11-28 04:11:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:25,169 INFO L225 Difference]: With dead ends: 67 [2024-11-28 04:11:25,169 INFO L226 Difference]: Without dead ends: 67 [2024-11-28 04:11:25,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:11:25,173 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-11-28 04:11:25,173 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-11-28 04:11:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-28 04:11:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-28 04:11:25,177 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-11-28 04:11:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-11-28 04:11:25,178 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 18 [2024-11-28 04:11:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:25,178 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-11-28 04:11:25,181 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-11-28 04:11:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-11-28 04:11:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 04:11:25,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:25,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 04:11:25,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:11:25,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:25,387 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-11-28 04:11:25,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123430, now seen corresponding path program 1 times [2024-11-28 04:11:25,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:25,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53348614] [2024-11-28 04:11:25,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:25,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:25,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:25,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53348614] [2024-11-28 04:11:25,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53348614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:25,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407456986] [2024-11-28 04:11:25,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:25,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:25,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:25,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:25,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:11:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:25,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 04:11:25,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:25,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:11:25,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:11:26,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:11:26,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 04:11:26,112 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:11:26,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:11:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:26,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:26,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407456986] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:26,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:26,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-28 04:11:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272375386] [2024-11-28 04:11:26,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:26,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:11:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:26,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:11:26,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:11:26,607 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-11-28 04:11:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:26,849 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-28 04:11:26,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:11:26,850 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-11-28 04:11:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:26,851 INFO L225 Difference]: With dead ends: 66 [2024-11-28 04:11:26,851 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 04:11:26,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:11:26,852 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:11:26,852 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.2s Time] [2024-11-28 04:11:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 04:11:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 04:11:26,859 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-11-28 04:11:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-28 04:11:26,864 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 18 [2024-11-28 04:11:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:26,864 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-28 04:11:26,864 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-11-28 04:11:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-28 04:11:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 04:11:26,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:26,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:11:26,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:11:27,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:27,066 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-11-28 04:11:27,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:27,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1140163937, now seen corresponding path program 2 times [2024-11-28 04:11:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283160654] [2024-11-28 04:11:27,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:11:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:27,117 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:11:27,118 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:11:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283160654] [2024-11-28 04:11:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283160654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054965401] [2024-11-28 04:11:27,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:11:27,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:27,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:27,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:27,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:11:27,371 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:11:27,371 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:11:27,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:11:27,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:27,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:27,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054965401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:27,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:27,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-28 04:11:27,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829275477] [2024-11-28 04:11:27,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:27,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:11:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:27,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:11:27,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:11:27,452 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-11-28 04:11:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:27,503 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2024-11-28 04:11:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:11:27,504 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-11-28 04:11:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:27,504 INFO L225 Difference]: With dead ends: 66 [2024-11-28 04:11:27,504 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 04:11:27,505 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-11-28 04:11:27,505 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-11-28 04:11:27,506 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-11-28 04:11:27,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 04:11:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 04:11:27,510 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-11-28 04:11:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-11-28 04:11:27,511 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 25 [2024-11-28 04:11:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:27,511 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-11-28 04:11:27,511 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-11-28 04:11:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-11-28 04:11:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 04:11:27,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:27,512 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-11-28 04:11:27,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:11:27,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:27,717 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-11-28 04:11:27,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1211453241, now seen corresponding path program 1 times [2024-11-28 04:11:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:27,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121478327] [2024-11-28 04:11:27,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:27,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:11:27,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:27,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121478327] [2024-11-28 04:11:27,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121478327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:27,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:27,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:11:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525389864] [2024-11-28 04:11:27,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:27,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:11:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:27,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:11:27,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:11:27,943 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-11-28 04:11:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:28,145 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-28 04:11:28,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:11:28,146 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-11-28 04:11:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:28,146 INFO L225 Difference]: With dead ends: 69 [2024-11-28 04:11:28,147 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 04:11:28,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:11:28,147 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:11:28,148 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.2s Time] [2024-11-28 04:11:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 04:11:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-28 04:11:28,154 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-11-28 04:11:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-11-28 04:11:28,155 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 26 [2024-11-28 04:11:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:28,159 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-11-28 04:11:28,159 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-11-28 04:11:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-11-28 04:11:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 04:11:28,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:28,160 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-11-28 04:11:28,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:11:28,161 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-11-28 04:11:28,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1211453240, now seen corresponding path program 1 times [2024-11-28 04:11:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:28,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19725621] [2024-11-28 04:11:28,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:11:28,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:28,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19725621] [2024-11-28 04:11:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19725621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:28,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:28,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:11:28,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69525119] [2024-11-28 04:11:28,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:28,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:11:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:28,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:11:28,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:11:28,564 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-11-28 04:11:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:28,760 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-11-28 04:11:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:11:28,761 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-11-28 04:11:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:28,763 INFO L225 Difference]: With dead ends: 69 [2024-11-28 04:11:28,763 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 04:11:28,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:11:28,764 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:11:28,765 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.2s Time] [2024-11-28 04:11:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 04:11:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-28 04:11:28,769 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-11-28 04:11:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-11-28 04:11:28,770 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 26 [2024-11-28 04:11:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:28,770 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-11-28 04:11:28,770 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-11-28 04:11:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-11-28 04:11:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 04:11:28,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:28,771 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-11-28 04:11:28,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:11:28,775 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-11-28 04:11:28,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash -189310014, now seen corresponding path program 1 times [2024-11-28 04:11:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:28,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996432810] [2024-11-28 04:11:28,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:11:28,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:28,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996432810] [2024-11-28 04:11:28,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996432810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:28,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304971290] [2024-11-28 04:11:28,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:28,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:28,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:28,970 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:28,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:11:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:29,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:11:29,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:11:29,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:11:29,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304971290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:29,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:11:29,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-28 04:11:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710026772] [2024-11-28 04:11:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:11:29,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:29,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:11:29,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:11:29,151 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-11-28 04:11:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:29,185 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-28 04:11:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:11:29,186 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-11-28 04:11:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:29,187 INFO L225 Difference]: With dead ends: 67 [2024-11-28 04:11:29,188 INFO L226 Difference]: Without dead ends: 67 [2024-11-28 04:11:29,188 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-11-28 04:11:29,189 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-11-28 04:11:29,190 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-11-28 04:11:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-28 04:11:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2024-11-28 04:11:29,193 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-11-28 04:11:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-11-28 04:11:29,194 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2024-11-28 04:11:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:29,194 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-11-28 04:11:29,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:11:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-11-28 04:11:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:11:29,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:29,195 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-11-28 04:11:29,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 04:11:29,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:29,399 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-11-28 04:11:29,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash 206727143, now seen corresponding path program 1 times [2024-11-28 04:11:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:29,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538814216] [2024-11-28 04:11:29,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:11:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:29,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538814216] [2024-11-28 04:11:29,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538814216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:29,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328535276] [2024-11-28 04:11:29,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:29,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:29,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:29,655 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:29,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:11:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:29,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:11:29,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:11:29,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:11:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328535276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:11:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-11-28 04:11:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307947656] [2024-11-28 04:11:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:29,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:11:29,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:29,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:11:29,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:11:29,907 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-11-28 04:11:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:29,978 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-11-28 04:11:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:11:29,979 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-11-28 04:11:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:29,979 INFO L225 Difference]: With dead ends: 51 [2024-11-28 04:11:29,979 INFO L226 Difference]: Without dead ends: 51 [2024-11-28 04:11:29,980 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-11-28 04:11:29,981 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-11-28 04:11:29,981 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-11-28 04:11:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-28 04:11:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-28 04:11:29,984 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-11-28 04:11:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-11-28 04:11:29,985 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 29 [2024-11-28 04:11:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:29,985 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-11-28 04:11:29,985 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-11-28 04:11:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-11-28 04:11:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:11:29,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:29,987 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-11-28 04:11:29,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:11:30,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 04:11:30,191 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-11-28 04:11:30,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:30,191 INFO L85 PathProgramCache]: Analyzing trace with hash 206727212, now seen corresponding path program 1 times [2024-11-28 04:11:30,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:30,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4573632] [2024-11-28 04:11:30,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:30,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:30,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4573632] [2024-11-28 04:11:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4573632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:30,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244882891] [2024-11-28 04:11:30,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:30,989 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:30,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:11:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:31,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 04:11:31,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:31,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:11:31,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:11:31,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:11:31,240 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-11-28 04:11:31,280 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-11-28 04:11:31,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:11:31,360 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-11-28 04:11:31,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:31,654 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-11-28 04:11:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:31,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:31,898 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 04:11:31,899 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-11-28 04:11:31,907 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-11-28 04:11:31,925 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-11-28 04:11:31,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:31,951 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-11-28 04:11:31,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:31,960 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-11-28 04:11:31,968 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-11-28 04:11:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 04:11:32,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244882891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:32,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:32,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2024-11-28 04:11:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664354931] [2024-11-28 04:11:32,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:32,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 04:11:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:32,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 04:11:32,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=790, Unknown=2, NotChecked=114, Total=992 [2024-11-28 04:11:32,085 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-11-28 04:11:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:33,367 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-11-28 04:11:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:11:33,368 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-11-28 04:11:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:33,369 INFO L225 Difference]: With dead ends: 71 [2024-11-28 04:11:33,369 INFO L226 Difference]: Without dead ends: 71 [2024-11-28 04:11:33,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=241, Invalid=1571, Unknown=2, NotChecked=166, Total=1980 [2024-11-28 04:11:33,371 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:11:33,371 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.6s Time] [2024-11-28 04:11:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-28 04:11:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2024-11-28 04:11:33,374 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-11-28 04:11:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-11-28 04:11:33,375 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 29 [2024-11-28 04:11:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:33,375 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-11-28 04:11:33,376 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-11-28 04:11:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-11-28 04:11:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:11:33,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:33,377 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-11-28 04:11:33,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:11:33,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 04:11:33,580 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-11-28 04:11:33,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash 206727213, now seen corresponding path program 1 times [2024-11-28 04:11:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322544133] [2024-11-28 04:11:33,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:34,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:34,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322544133] [2024-11-28 04:11:34,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322544133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:34,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748736414] [2024-11-28 04:11:34,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:34,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:34,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:34,721 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:34,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:11:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:34,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 04:11:34,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:34,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:11:34,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:11:35,007 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:11:35,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:11:35,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 04:11:35,075 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-11-28 04:11:35,083 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-11-28 04:11:35,156 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-11-28 04:11:35,169 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-11-28 04:11:35,276 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:11:35,276 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-11-28 04:11:35,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-11-28 04:11:35,706 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-11-28 04:11:35,718 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-11-28 04:11:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:35,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:36,352 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-11-28 04:11:36,384 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-11-28 04:11:36,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:36,402 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-11-28 04:11:36,407 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-11-28 04:11:36,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:36,426 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-11-28 04:11:36,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:36,442 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-11-28 04:11:36,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:36,450 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-11-28 04:11:36,455 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:36,457 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-11-28 04:11:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 04:11:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748736414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:36,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:36,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2024-11-28 04:11:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224234230] [2024-11-28 04:11:36,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:36,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 04:11:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:36,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 04:11:36,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1169, Unknown=2, NotChecked=138, Total=1406 [2024-11-28 04:11:36,887 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-11-28 04:11:38,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:38,680 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2024-11-28 04:11:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:11:38,681 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-11-28 04:11:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:38,681 INFO L225 Difference]: With dead ends: 66 [2024-11-28 04:11:38,682 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 04:11:38,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=294, Invalid=2262, Unknown=2, NotChecked=198, Total=2756 [2024-11-28 04:11:38,684 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:11:38,684 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.6s Time] [2024-11-28 04:11:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 04:11:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2024-11-28 04:11:38,687 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-11-28 04:11:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-28 04:11:38,687 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 29 [2024-11-28 04:11:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:38,688 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-28 04:11:38,688 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-11-28 04:11:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-28 04:11:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 04:11:38,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:38,689 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-11-28 04:11:38,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 04:11:38,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-28 04:11:38,890 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-11-28 04:11:38,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash -441759130, now seen corresponding path program 1 times [2024-11-28 04:11:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:38,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294250822] [2024-11-28 04:11:38,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 04:11:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:39,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294250822] [2024-11-28 04:11:39,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294250822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:39,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:39,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:11:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745360529] [2024-11-28 04:11:39,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:39,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:11:39,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:39,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:11:39,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:11:39,042 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-11-28 04:11:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:39,190 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-11-28 04:11:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:11:39,191 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-11-28 04:11:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:39,192 INFO L225 Difference]: With dead ends: 59 [2024-11-28 04:11:39,192 INFO L226 Difference]: Without dead ends: 59 [2024-11-28 04:11:39,192 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-11-28 04:11:39,192 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-11-28 04:11:39,193 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-11-28 04:11:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-28 04:11:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-28 04:11:39,200 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-11-28 04:11:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-11-28 04:11:39,201 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 33 [2024-11-28 04:11:39,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:39,201 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-11-28 04:11:39,202 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-11-28 04:11:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-11-28 04:11:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 04:11:39,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:39,203 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-11-28 04:11:39,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:11:39,203 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-11-28 04:11:39,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash -441759129, now seen corresponding path program 1 times [2024-11-28 04:11:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:39,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646639041] [2024-11-28 04:11:39,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:39,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:11:39,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:39,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646639041] [2024-11-28 04:11:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646639041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:39,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660903756] [2024-11-28 04:11:39,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:39,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:39,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:39,365 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:39,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:11:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:39,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:11:39,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:11:39,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:11:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660903756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:11:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-28 04:11:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565186172] [2024-11-28 04:11:39,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:39,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:11:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:39,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:11:39,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:11:39,616 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-11-28 04:11:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:39,675 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-28 04:11:39,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:11:39,676 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-11-28 04:11:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:39,676 INFO L225 Difference]: With dead ends: 58 [2024-11-28 04:11:39,676 INFO L226 Difference]: Without dead ends: 58 [2024-11-28 04:11:39,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:11:39,677 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-11-28 04:11:39,677 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-11-28 04:11:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-28 04:11:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-28 04:11:39,684 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-11-28 04:11:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-11-28 04:11:39,685 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 33 [2024-11-28 04:11:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:39,685 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-11-28 04:11:39,685 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-11-28 04:11:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-11-28 04:11:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 04:11:39,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:39,686 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-11-28 04:11:39,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 04:11:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 04:11:39,887 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-11-28 04:11:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1367519417, now seen corresponding path program 1 times [2024-11-28 04:11:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269938213] [2024-11-28 04:11:39,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:11:40,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:40,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269938213] [2024-11-28 04:11:40,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269938213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:40,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694144828] [2024-11-28 04:11:40,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:40,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:40,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:40,004 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:40,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:11:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:40,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:11:40,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:11:40,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:11:40,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694144828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:40,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:40,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-28 04:11:40,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537412395] [2024-11-28 04:11:40,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:40,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:11:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:40,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:11:40,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:11:40,329 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-11-28 04:11:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:40,370 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-28 04:11:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:11:40,370 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-11-28 04:11:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:40,371 INFO L225 Difference]: With dead ends: 59 [2024-11-28 04:11:40,371 INFO L226 Difference]: Without dead ends: 59 [2024-11-28 04:11:40,371 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-11-28 04:11:40,372 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-11-28 04:11:40,372 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-11-28 04:11:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-28 04:11:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-28 04:11:40,375 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-11-28 04:11:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-11-28 04:11:40,375 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 36 [2024-11-28 04:11:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:40,376 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-28 04:11:40,376 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-11-28 04:11:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-11-28 04:11:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 04:11:40,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:40,377 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-11-28 04:11:40,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 04:11:40,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 04:11:40,581 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-11-28 04:11:40,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1960827259, now seen corresponding path program 1 times [2024-11-28 04:11:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:40,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610116178] [2024-11-28 04:11:40,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:11:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610116178] [2024-11-28 04:11:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610116178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:40,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340202575] [2024-11-28 04:11:40,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:40,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:40,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:40,709 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:40,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:11:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:40,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:11:40,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:11:40,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:11:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340202575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:41,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:41,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-11-28 04:11:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834171067] [2024-11-28 04:11:41,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:41,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:11:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:41,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:11:41,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:11:41,056 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-11-28 04:11:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:41,149 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-11-28 04:11:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:11:41,150 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-11-28 04:11:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:41,151 INFO L225 Difference]: With dead ends: 54 [2024-11-28 04:11:41,152 INFO L226 Difference]: Without dead ends: 54 [2024-11-28 04:11:41,152 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-11-28 04:11:41,153 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-11-28 04:11:41,153 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-11-28 04:11:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-28 04:11:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-28 04:11:41,154 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-11-28 04:11:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-11-28 04:11:41,155 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 37 [2024-11-28 04:11:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:41,156 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-11-28 04:11:41,156 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-11-28 04:11:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-11-28 04:11:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 04:11:41,157 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:41,157 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-11-28 04:11:41,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 04:11:41,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 04:11:41,362 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-11-28 04:11:41,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:41,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1336921024, now seen corresponding path program 2 times [2024-11-28 04:11:41,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:41,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809134958] [2024-11-28 04:11:41,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:11:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:41,391 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:11:41,391 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:11:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:11:41,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:41,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809134958] [2024-11-28 04:11:41,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809134958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:41,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:41,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:11:41,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358492761] [2024-11-28 04:11:41,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:41,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:11:41,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:41,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:11:41,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:11:41,660 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-11-28 04:11:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:41,809 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-11-28 04:11:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:11:41,810 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-11-28 04:11:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:41,810 INFO L225 Difference]: With dead ends: 56 [2024-11-28 04:11:41,811 INFO L226 Difference]: Without dead ends: 56 [2024-11-28 04:11:41,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:11:41,811 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-11-28 04:11:41,811 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-11-28 04:11:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-28 04:11:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-28 04:11:41,814 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-11-28 04:11:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2024-11-28 04:11:41,815 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 41 [2024-11-28 04:11:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:41,816 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2024-11-28 04:11:41,816 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-11-28 04:11:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-11-28 04:11:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-28 04:11:41,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:41,817 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-11-28 04:11:41,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:11:41,817 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-11-28 04:11:41,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1505123640, now seen corresponding path program 1 times [2024-11-28 04:11:41,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:41,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196216270] [2024-11-28 04:11:41,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:41,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:11:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:41,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196216270] [2024-11-28 04:11:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196216270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:41,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:11:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551318869] [2024-11-28 04:11:41,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:41,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:11:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:41,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:11:41,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:11:41,955 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-11-28 04:11:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:42,058 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-11-28 04:11:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:11:42,059 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-11-28 04:11:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:42,060 INFO L225 Difference]: With dead ends: 58 [2024-11-28 04:11:42,060 INFO L226 Difference]: Without dead ends: 58 [2024-11-28 04:11:42,060 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-11-28 04:11:42,061 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-11-28 04:11:42,062 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-11-28 04:11:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-28 04:11:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-28 04:11:42,068 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-11-28 04:11:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-11-28 04:11:42,068 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 42 [2024-11-28 04:11:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:42,069 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-28 04:11:42,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:11:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2024-11-28 04:11:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 04:11:42,069 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:42,069 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-11-28 04:11:42,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:11:42,070 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-11-28 04:11:42,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash -982412659, now seen corresponding path program 1 times [2024-11-28 04:11:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:42,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645660365] [2024-11-28 04:11:42,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:11:42,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:42,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645660365] [2024-11-28 04:11:42,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645660365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:11:42,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:11:42,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:11:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159040361] [2024-11-28 04:11:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:11:42,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:11:42,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:42,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:11:42,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:11:42,267 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-11-28 04:11:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:42,393 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2024-11-28 04:11:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:11:42,394 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-11-28 04:11:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:42,395 INFO L225 Difference]: With dead ends: 57 [2024-11-28 04:11:42,395 INFO L226 Difference]: Without dead ends: 57 [2024-11-28 04:11:42,396 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-11-28 04:11:42,397 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-11-28 04:11:42,398 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-11-28 04:11:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-28 04:11:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-28 04:11:42,400 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-11-28 04:11:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2024-11-28 04:11:42,401 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2024-11-28 04:11:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:42,401 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-11-28 04:11:42,401 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-11-28 04:11:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-11-28 04:11:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:11:42,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:42,402 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-11-28 04:11:42,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 04:11:42,402 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-11-28 04:11:42,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1148196953, now seen corresponding path program 1 times [2024-11-28 04:11:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:42,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839790151] [2024-11-28 04:11:42,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 04:11:43,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:43,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839790151] [2024-11-28 04:11:43,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839790151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:43,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095516315] [2024-11-28 04:11:43,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:43,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:43,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:43,942 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:43,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:11:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:44,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-28 04:11:44,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:44,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:11:44,212 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:11:44,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:11:44,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:11:44,300 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-11-28 04:11:44,378 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:11:44,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 04:11:44,848 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:11:44,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 04:11:44,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:11:44,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:11:44,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:44,970 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-11-28 04:11:45,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:45,124 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-11-28 04:11:45,342 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:11:45,343 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-11-28 04:11:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:11:45,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:45,588 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-11-28 04:11:45,904 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-11-28 04:11:45,921 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-11-28 04:11:45,948 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-11-28 04:11:45,973 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-11-28 04:11:45,985 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-11-28 04:11:46,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:46,296 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-11-28 04:11:46,352 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-11-28 04:11:46,407 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-11-28 04:11:46,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:46,432 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-11-28 04:11:46,437 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-11-28 04:11:46,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:46,457 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-11-28 04:11:46,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 217 [2024-11-28 04:11:46,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:46,501 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-11-28 04:11:46,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:46,647 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-11-28 04:11:46,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:46,658 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-11-28 04:11:46,663 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:46,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-28 04:11:46,670 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:46,690 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-11-28 04:11:46,691 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-11-28 04:11:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-28 04:11:46,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095516315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:46,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:46,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 53 [2024-11-28 04:11:46,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971876321] [2024-11-28 04:11:46,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:46,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-28 04:11:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:46,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-28 04:11:46,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1882, Unknown=29, NotChecked=760, Total=2862 [2024-11-28 04:11:46,874 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-11-28 04:11:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:48,572 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-11-28 04:11:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 04:11:48,573 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-11-28 04:11:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:48,574 INFO L225 Difference]: With dead ends: 67 [2024-11-28 04:11:48,574 INFO L226 Difference]: Without dead ends: 67 [2024-11-28 04:11:48,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=349, Invalid=2959, Unknown=30, NotChecked=952, Total=4290 [2024-11-28 04:11:48,581 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:11:48,581 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.8s Time] [2024-11-28 04:11:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-28 04:11:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-11-28 04:11:48,584 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-11-28 04:11:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-28 04:11:48,584 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 47 [2024-11-28 04:11:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-28 04:11:48,585 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-11-28 04:11:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-28 04:11:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:11:48,586 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:48,586 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-11-28 04:11:48,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:11:48,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:48,787 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-11-28 04:11:48,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1148196952, now seen corresponding path program 1 times [2024-11-28 04:11:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:48,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927927621] [2024-11-28 04:11:48,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:48,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:11:50,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:50,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927927621] [2024-11-28 04:11:50,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927927621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:50,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642819160] [2024-11-28 04:11:50,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:50,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:50,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:50,573 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:50,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:11:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:50,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-28 04:11:50,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:50,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:11:50,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:11:50,955 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:11:50,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 04:11:50,973 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:11:50,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:11:51,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:11:51,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:11:51,093 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-11-28 04:11:51,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:11:51,181 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:11:51,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-28 04:11:51,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:11:51,773 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:11:51,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 57 treesize of output 50 [2024-11-28 04:11:51,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:11:51,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:11:51,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:11:51,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:11:51,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:11:51,955 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-11-28 04:11:52,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:52,116 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-11-28 04:11:52,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:52,134 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-11-28 04:11:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:11:52,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:11:52,736 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-11-28 04:11:54,490 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-11-28 04:11:54,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:54,520 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-11-28 04:11:54,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:54,536 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-11-28 04:11:54,544 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-11-28 04:11:54,563 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-11-28 04:11:54,579 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-11-28 04:11:54,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2024-11-28 04:11:54,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:54,609 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-11-28 04:11:54,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:54,629 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-11-28 04:11:54,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:54,715 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-11-28 04:11:54,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:54,730 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-11-28 04:11:54,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:54,737 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-11-28 04:11:54,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:54,745 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:54,747 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-11-28 04:11:54,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:54,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-28 04:11:54,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:11:54,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 87 [2024-11-28 04:11:54,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:54,787 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:54,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:11:54,789 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-11-28 04:11:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 04:11:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642819160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:55,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:55,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 58 [2024-11-28 04:11:55,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774456519] [2024-11-28 04:11:55,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:55,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-28 04:11:55,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:55,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-28 04:11:55,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2982, Unknown=18, NotChecked=222, Total=3422 [2024-11-28 04:11:55,273 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-11-28 04:11:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:11:57,836 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-28 04:11:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 04:11:57,836 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-11-28 04:11:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:11:57,837 INFO L225 Difference]: With dead ends: 69 [2024-11-28 04:11:57,837 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 04:11:57,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=420, Invalid=4826, Unknown=18, NotChecked=286, Total=5550 [2024-11-28 04:11:57,839 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:11:57,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 445 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1042 Invalid, 0 Unknown, 114 Unchecked, 1.1s Time] [2024-11-28 04:11:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 04:11:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-11-28 04:11:57,841 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-11-28 04:11:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-11-28 04:11:57,842 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 47 [2024-11-28 04:11:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:11:57,842 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-11-28 04:11:57,843 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-11-28 04:11:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-11-28 04:11:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 04:11:57,843 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:11:57,843 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-11-28 04:11:57,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 04:11:58,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 04:11:58,058 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-11-28 04:11:58,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:11:58,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1234364720, now seen corresponding path program 1 times [2024-11-28 04:11:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:11:58,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586144011] [2024-11-28 04:11:58,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:58,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:11:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:11:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:11:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586144011] [2024-11-28 04:11:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586144011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:11:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879687864] [2024-11-28 04:11:59,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:11:59,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:11:59,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:11:59,239 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:11:59,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:11:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:11:59,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 04:11:59,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:11:59,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:11:59,579 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:11:59,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:11:59,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:11:59,664 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-11-28 04:11:59,756 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:11:59,756 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-11-28 04:12:00,141 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:12:00,141 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-11-28 04:12:00,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:00,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:00,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:00,236 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-11-28 04:12:00,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:00,364 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-11-28 04:12:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:12:00,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:12:00,668 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-11-28 04:12:00,772 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-11-28 04:12:00,798 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-11-28 04:12:01,064 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-11-28 04:12:01,078 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-11-28 04:12:01,204 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-11-28 04:12:01,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:01,408 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-11-28 04:12:01,413 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-11-28 04:12:01,422 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-11-28 04:12:01,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:01,445 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-11-28 04:12:01,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:01,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 83 [2024-11-28 04:12:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-28 04:12:01,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879687864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:12:01,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:12:01,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 23] total 58 [2024-11-28 04:12:01,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106934585] [2024-11-28 04:12:01,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:12:01,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 04:12:01,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:01,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 04:12:01,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2424, Unknown=31, NotChecked=630, Total=3306 [2024-11-28 04:12:01,825 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-11-28 04:12:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:03,602 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-28 04:12:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 04:12:03,602 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-11-28 04:12:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:03,603 INFO L225 Difference]: With dead ends: 71 [2024-11-28 04:12:03,603 INFO L226 Difference]: Without dead ends: 71 [2024-11-28 04:12:03,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=470, Invalid=4339, Unknown=45, NotChecked=846, Total=5700 [2024-11-28 04:12:03,605 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 21 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:03,605 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.6s Time] [2024-11-28 04:12:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-28 04:12:03,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2024-11-28 04:12:03,607 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-11-28 04:12:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2024-11-28 04:12:03,607 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 48 [2024-11-28 04:12:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:03,607 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-11-28 04:12:03,608 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-11-28 04:12:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2024-11-28 04:12:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 04:12:03,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:03,608 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-11-28 04:12:03,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 04:12:03,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 04:12:03,809 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-11-28 04:12:03,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash -815774171, now seen corresponding path program 1 times [2024-11-28 04:12:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:03,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880034811] [2024-11-28 04:12:03,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:12:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880034811] [2024-11-28 04:12:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880034811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:12:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596842202] [2024-11-28 04:12:05,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:12:05,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:05,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:12:05,021 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:12:05,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:12:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:12:05,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 04:12:05,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:12:05,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:12:05,317 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:12:05,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:12:05,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:12:05,365 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-11-28 04:12:05,437 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:12:05,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 04:12:05,783 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:12:05,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 04:12:05,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:05,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:05,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:05,874 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-11-28 04:12:05,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:05,990 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-11-28 04:12:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:12:06,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:12:06,316 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-11-28 04:12:06,623 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-11-28 04:12:06,635 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-11-28 04:12:06,654 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-11-28 04:12:06,673 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-11-28 04:12:06,683 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-11-28 04:12:06,704 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-11-28 04:12:06,719 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-11-28 04:12:06,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:06,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 46 [2024-11-28 04:12:06,896 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-11-28 04:12:06,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:06,927 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-11-28 04:12:06,940 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-11-28 04:12:06,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:06,953 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-11-28 04:12:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-28 04:12:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596842202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:12:07,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:12:07,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 52 [2024-11-28 04:12:07,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131850141] [2024-11-28 04:12:07,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:12:07,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-28 04:12:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:12:07,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-28 04:12:07,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1787, Unknown=40, NotChecked=744, Total=2756 [2024-11-28 04:12:07,575 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-11-28 04:12:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:12:09,084 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2024-11-28 04:12:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 04:12:09,084 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-11-28 04:12:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:12:09,085 INFO L225 Difference]: With dead ends: 70 [2024-11-28 04:12:09,085 INFO L226 Difference]: Without dead ends: 70 [2024-11-28 04:12:09,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=337, Invalid=2958, Unknown=43, NotChecked=952, Total=4290 [2024-11-28 04:12:09,086 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:12:09,087 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.7s Time] [2024-11-28 04:12:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-28 04:12:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2024-11-28 04:12:09,089 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-11-28 04:12:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2024-11-28 04:12:09,089 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 50 [2024-11-28 04:12:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:12:09,090 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2024-11-28 04:12:09,090 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-11-28 04:12:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2024-11-28 04:12:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 04:12:09,090 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:12:09,091 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-11-28 04:12:09,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 04:12:09,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 04:12:09,291 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-11-28 04:12:09,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:12:09,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1803195121, now seen corresponding path program 2 times [2024-11-28 04:12:09,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:12:09,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875467421] [2024-11-28 04:12:09,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:12:09,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:12:09,344 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:12:09,348 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:12:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:12:11,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:12:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875467421] [2024-11-28 04:12:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875467421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:12:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741801008] [2024-11-28 04:12:11,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:12:11,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:12:11,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:12:11,809 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:12:11,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:12:12,028 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:12:12,028 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:12:12,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-28 04:12:12,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:12:12,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 6 treesize of output 5 [2024-11-28 04:12:12,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:12:12,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:12:12,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:12:12,103 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-11-28 04:12:12,258 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:12:12,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:12:12,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-28 04:12:12,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:12:12,369 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-11-28 04:12:12,378 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-11-28 04:12:12,461 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-11-28 04:12:12,469 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-11-28 04:12:12,592 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-28 04:12:12,592 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-11-28 04:12:12,600 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-11-28 04:12:13,322 INFO L349 Elim1Store]: treesize reduction 160, result has 37.7 percent of original size [2024-11-28 04:12:13,323 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-11-28 04:12:13,419 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2024-11-28 04:12:13,419 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-11-28 04:12:14,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:14,771 INFO L349 Elim1Store]: treesize reduction 128, result has 32.3 percent of original size [2024-11-28 04:12:14,772 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-11-28 04:12:14,824 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-28 04:12:14,824 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-11-28 04:12:16,402 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-11-28 04:12:16,418 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-11-28 04:12:16,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:16,557 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-11-28 04:12:16,592 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 04:12:16,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:16,606 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-11-28 04:12:16,621 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 04:12:16,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:16,632 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-11-28 04:12:16,841 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 04:12:17,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:17,248 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-11-28 04:12:17,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:12:17,278 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-11-28 04:12:22,004 INFO L349 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2024-11-28 04:12:22,004 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-11-28 04:12:22,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:12:22,009 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-11-28 04:12:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:12:22,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:13:45,115 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-11-28 04:13:49,975 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-11-28 04:13:54,909 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-11-28 04:13:59,508 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-11-28 04:14:04,162 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-11-28 04:14:09,162 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-11-28 04:14:13,469 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-11-28 04:14:13,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:13,631 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-11-28 04:14:13,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:13,734 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-11-28 04:14:14,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:14,387 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-11-28 04:14:14,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:14,491 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-11-28 04:14:14,889 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-11-28 04:14:28,055 INFO L349 Elim1Store]: treesize reduction 418, result has 44.3 percent of original size [2024-11-28 04:14:28,055 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-11-28 04:14:28,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:28,675 INFO L349 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2024-11-28 04:14:28,676 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-11-28 04:14:29,237 INFO L349 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2024-11-28 04:14:29,238 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-11-28 04:14:29,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:29,715 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-11-28 04:14:31,155 INFO L349 Elim1Store]: treesize reduction 147, result has 36.4 percent of original size [2024-11-28 04:14:31,156 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-11-28 04:14:31,525 INFO L224 Elim1Store]: Index analysis took 204 ms [2024-11-28 04:14:33,229 INFO L349 Elim1Store]: treesize reduction 200, result has 32.7 percent of original size [2024-11-28 04:14:33,230 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-11-28 04:14:34,519 INFO L224 Elim1Store]: Index analysis took 682 ms [2024-11-28 04:14:36,559 INFO L349 Elim1Store]: treesize reduction 297, result has 10.0 percent of original size [2024-11-28 04:14:36,559 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-11-28 04:14:37,440 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-11-28 04:14:39,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:39,840 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-11-28 04:14:40,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:40,048 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-11-28 04:14:40,342 INFO L224 Elim1Store]: Index analysis took 150 ms [2024-11-28 04:14:41,099 INFO L349 Elim1Store]: treesize reduction 52, result has 49.0 percent of original size [2024-11-28 04:14:41,099 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-11-28 04:14:41,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 04:14:42,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:42,083 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-11-28 04:14:42,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:42,752 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-11-28 04:14:46,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 04:14:46,852 INFO L224 Elim1Store]: Index analysis took 243 ms [2024-11-28 04:14:47,453 INFO L349 Elim1Store]: treesize reduction 89, result has 37.8 percent of original size [2024-11-28 04:14:47,454 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-11-28 04:14:48,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:48,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:48,469 INFO L224 Elim1Store]: Index analysis took 137 ms [2024-11-28 04:14:48,470 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-11-28 04:14:49,393 INFO L224 Elim1Store]: Index analysis took 195 ms [2024-11-28 04:14:49,429 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-11-28 04:14:49,429 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-11-28 04:14:50,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 04:14:50,579 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:50,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:50,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:50,813 INFO L224 Elim1Store]: Index analysis took 111 ms [2024-11-28 04:14:51,330 INFO L349 Elim1Store]: treesize reduction 61, result has 27.4 percent of original size [2024-11-28 04:14:51,330 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-11-28 04:14:51,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:51,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:51,671 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:51,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:51,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:51,718 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-11-28 04:14:52,134 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:52,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:52,165 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:14:52,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:52,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:14:52,213 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-11-28 04:14:52,720 INFO L224 Elim1Store]: Index analysis took 252 ms [2024-11-28 04:14:53,672 INFO L349 Elim1Store]: treesize reduction 181, result has 17.4 percent of original size [2024-11-28 04:14:53,672 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-11-28 04:14:54,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:14:54,376 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-11-28 04:14:55,118 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-11-28 04:14:55,148 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-11-28 04:14:56,354 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-11-28 04:14:56,809 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-11-28 04:14:57,117 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-11-28 04:14:57,117 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-11-28 04:14:59,912 INFO L349 Elim1Store]: treesize reduction 52, result has 72.2 percent of original size [2024-11-28 04:14:59,913 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-11-28 04:15:04,730 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-11-28 04:15:05,904 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:15:06,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:06,008 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-11-28 04:15:06,219 INFO L224 Elim1Store]: Index analysis took 109 ms [2024-11-28 04:15:06,870 INFO L349 Elim1Store]: treesize reduction 60, result has 41.2 percent of original size [2024-11-28 04:15:06,871 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-11-28 04:15:06,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 04:15:08,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:08,167 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-11-28 04:15:09,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:09,158 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-11-28 04:15:09,881 INFO L224 Elim1Store]: Index analysis took 147 ms [2024-11-28 04:15:10,655 INFO L349 Elim1Store]: treesize reduction 202, result has 24.3 percent of original size [2024-11-28 04:15:10,655 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-11-28 04:15:11,462 INFO L224 Elim1Store]: Index analysis took 203 ms [2024-11-28 04:15:11,556 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2024-11-28 04:15:11,556 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-11-28 04:15:12,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:12,557 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-11-28 04:15:13,199 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-28 04:15:13,200 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-11-28 04:15:13,774 INFO L224 Elim1Store]: Index analysis took 134 ms [2024-11-28 04:15:14,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:14,280 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-11-28 04:15:14,926 INFO L224 Elim1Store]: Index analysis took 533 ms [2024-11-28 04:15:17,995 INFO L349 Elim1Store]: treesize reduction 24, result has 87.3 percent of original size [2024-11-28 04:15:17,995 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-11-28 04:15:23,308 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-11-28 04:15:24,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:24,824 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-11-28 04:15:25,040 INFO L224 Elim1Store]: Index analysis took 111 ms [2024-11-28 04:15:25,664 INFO L349 Elim1Store]: treesize reduction 60, result has 41.2 percent of original size [2024-11-28 04:15:25,665 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-11-28 04:15:25,731 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:15:25,763 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:15:25,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-28 04:15:26,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:26,939 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-11-28 04:15:27,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:15:27,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:27,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:15:27,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:15:27,989 INFO L224 Elim1Store]: Index analysis took 107 ms [2024-11-28 04:15:28,636 INFO L349 Elim1Store]: treesize reduction 167, result has 14.8 percent of original size [2024-11-28 04:15:28,637 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-11-28 04:15:28,867 INFO L224 Elim1Store]: Index analysis took 172 ms [2024-11-28 04:15:29,883 INFO L349 Elim1Store]: treesize reduction 10, result has 85.9 percent of original size [2024-11-28 04:15:29,883 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-11-28 04:15:32,964 INFO L349 Elim1Store]: treesize reduction 813, result has 8.3 percent of original size [2024-11-28 04:15:32,964 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-11-28 04:15:33,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:33,464 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-11-28 04:15:34,469 INFO L349 Elim1Store]: treesize reduction 50, result has 28.6 percent of original size [2024-11-28 04:15:34,469 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-11-28 04:15:34,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 494 treesize of output 486 [2024-11-28 04:15:34,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:34,968 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-11-28 04:15:36,603 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:36,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:36,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:15:37,223 INFO L349 Elim1Store]: treesize reduction 67, result has 38.5 percent of original size [2024-11-28 04:15:37,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 1572 treesize of output 1430 [2024-11-28 04:15:37,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:37,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:15:37,293 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-11-28 04:15:37,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:37,512 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:37,535 INFO L224 Elim1Store]: Index analysis took 140 ms [2024-11-28 04:15:38,659 INFO L349 Elim1Store]: treesize reduction 86, result has 49.1 percent of original size [2024-11-28 04:15:38,660 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-11-28 04:15:38,727 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-11-28 04:15:38,774 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:38,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:38,921 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-28 04:15:38,922 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-11-28 04:15:39,427 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:39,450 INFO L224 Elim1Store]: Index analysis took 142 ms [2024-11-28 04:15:39,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:15:39,885 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-11-28 04:15:39,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:39,932 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:15:39,933 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-11-28 04:15:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-28 04:15:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741801008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:15:42,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:15:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 31] total 71 [2024-11-28 04:15:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671986411] [2024-11-28 04:15:42,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:15:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-28 04:15:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:15:42,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-28 04:15:42,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3649, Unknown=35, NotChecked=1032, Total=4970 [2024-11-28 04:15:42,749 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-11-28 04:16:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:39,052 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2024-11-28 04:16:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 04:16:39,053 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-11-28 04:16:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:39,053 INFO L225 Difference]: With dead ends: 107 [2024-11-28 04:16:39,053 INFO L226 Difference]: Without dead ends: 107 [2024-11-28 04:16:39,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 156.3s TimeCoverageRelationStatistics Valid=433, Invalid=6202, Unknown=39, NotChecked=1336, Total=8010 [2024-11-28 04:16:39,056 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 497 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:39,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 958 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1540 Invalid, 0 Unknown, 497 Unchecked, 19.7s Time] [2024-11-28 04:16:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-28 04:16:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-11-28 04:16:39,060 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-11-28 04:16:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2024-11-28 04:16:39,061 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 53 [2024-11-28 04:16:39,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:39,061 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2024-11-28 04:16:39,062 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-11-28 04:16:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2024-11-28 04:16:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 04:16:39,062 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:39,063 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-11-28 04:16:39,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 04:16:39,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 04:16:39,263 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-11-28 04:16:39,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -64471448, now seen corresponding path program 2 times [2024-11-28 04:16:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373477300] [2024-11-28 04:16:39,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:16:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:39,300 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:16:39,300 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:16:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:16:46,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:46,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373477300] [2024-11-28 04:16:46,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373477300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:16:46,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477189308] [2024-11-28 04:16:46,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:16:46,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:16:46,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:16:46,492 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:16:46,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:16:46,734 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:16:46,735 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:16:46,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-28 04:16:46,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:16:48,018 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-28 04:16:48,018 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-11-28 04:16:48,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:16:49,543 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-11-28 04:16:50,419 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:16:50,419 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-11-28 04:16:56,258 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-11-28 04:16:56,259 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-11-28 04:16:56,547 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-28 04:16:56,547 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-11-28 04:16:59,986 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-11-28 04:16:59,987 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-11-28 04:17:08,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:08,941 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-11-28 04:17:19,455 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-11-28 04:17:21,015 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-28 04:17:21,015 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-11-28 04:17:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:22,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:17:30,809 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-11-28 04:17:30,886 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-11-28 04:17:30,936 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-11-28 04:17:31,011 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-11-28 04:17:31,062 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-11-28 04:17:31,159 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-11-28 04:17:31,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:31,265 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-11-28 04:17:31,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:31,445 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-11-28 04:17:31,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 223 [2024-11-28 04:17:31,502 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-11-28 04:17:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2024-11-28 04:17:52,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477189308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:17:52,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:17:52,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 22] total 58 [2024-11-28 04:17:52,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534311360] [2024-11-28 04:17:52,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:17:52,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-28 04:17:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:52,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-28 04:17:52,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2578, Unknown=10, NotChecked=642, Total=3422 [2024-11-28 04:17:52,808 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-11-28 04:18:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:18:18,146 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2024-11-28 04:18:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 04:18:18,146 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-11-28 04:18:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:18:18,147 INFO L225 Difference]: With dead ends: 107 [2024-11-28 04:18:18,147 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 04:18:18,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 54.9s TimeCoverageRelationStatistics Valid=295, Invalid=3879, Unknown=10, NotChecked=786, Total=4970 [2024-11-28 04:18:18,149 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s 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, 13.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:18:18,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 663 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1057 Invalid, 0 Unknown, 391 Unchecked, 13.0s Time] [2024-11-28 04:18:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 04:18:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-28 04:18:18,151 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-11-28 04:18:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2024-11-28 04:18:18,152 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 54 [2024-11-28 04:18:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:18:18,152 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2024-11-28 04:18:18,152 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-11-28 04:18:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-11-28 04:18:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 04:18:18,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:18:18,153 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-11-28 04:18:18,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 04:18:18,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 04:18:18,354 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-11-28 04:18:18,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:18:18,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2136856022, now seen corresponding path program 3 times [2024-11-28 04:18:18,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:18:18,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364551553] [2024-11-28 04:18:18,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:18:18,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:18:18,399 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:18:18,400 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:18:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 04:18:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:18:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364551553] [2024-11-28 04:18:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364551553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:18:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251769135] [2024-11-28 04:18:18,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:18:18,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:18:18,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:18:18,880 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:18:18,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 04:18:19,583 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:18:19,583 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:18:19,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:18:19,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:18:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 04:18:20,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:18:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251769135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:18:20,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:18:20,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-28 04:18:20,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718059835] [2024-11-28 04:18:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:18:20,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:18:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:18:20,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:18:20,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:18:20,074 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-11-28 04:18:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:18:20,166 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-11-28 04:18:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:18:20,167 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-11-28 04:18:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:18:20,167 INFO L225 Difference]: With dead ends: 20 [2024-11-28 04:18:20,167 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 04:18:20,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:18:20,168 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-11-28 04:18:20,168 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-11-28 04:18:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 04:18:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 04:18:20,168 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-11-28 04:18:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 04:18:20,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2024-11-28 04:18:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:18:20,169 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 04:18:20,169 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-11-28 04:18:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 04:18:20,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 04:18:20,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2024-11-28 04:18:20,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-11-28 04:18:20,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-11-28 04:18:20,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-11-28 04:18:20,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-11-28 04:18:20,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-11-28 04:18:20,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-11-28 04:18:20,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-11-28 04:18:20,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-11-28 04:18:20,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-11-28 04:18:20,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-11-28 04:18:20,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2024-11-28 04:18:20,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2024-11-28 04:18:20,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2024-11-28 04:18:20,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2024-11-28 04:18:20,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2024-11-28 04:18:20,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2024-11-28 04:18:20,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2024-11-28 04:18:20,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2024-11-28 04:18:20,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2024-11-28 04:18:20,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2024-11-28 04:18:20,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (1 of 23 remaining) [2024-11-28 04:18:20,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2024-11-28 04:18:20,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 04:18:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 04:18:20,377 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-11-28 04:18:20,380 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:18:20,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:18:20 BoogieIcfgContainer [2024-11-28 04:18:20,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:18:20,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:18:20,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:18:20,385 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:18:20,385 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:11:22" (3/4) ... [2024-11-28 04:18:20,388 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 04:18:20,394 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2024-11-28 04:18:20,398 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-28 04:18:20,399 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-28 04:18:20,399 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 04:18:20,399 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 04:18:20,481 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:18:20,481 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:18:20,481 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:18:20,482 INFO L158 Benchmark]: Toolchain (without parser) took 419905.57ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.4MB in the beginning and 57.7MB in the end (delta: 33.7MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. [2024-11-28 04:18:20,482 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:18:20,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.98ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:18:20,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.25ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 71.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:18:20,483 INFO L158 Benchmark]: Boogie Preprocessor took 74.95ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:18:20,483 INFO L158 Benchmark]: RCFGBuilder took 744.82ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 51.3MB in the end (delta: 17.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:18:20,483 INFO L158 Benchmark]: TraceAbstraction took 418328.34ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 50.8MB in the beginning and 62.1MB in the end (delta: -11.3MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2024-11-28 04:18:20,484 INFO L158 Benchmark]: Witness Printer took 97.03ms. Allocated memory is still 201.3MB. Free memory was 62.1MB in the beginning and 57.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:18:20,485 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.48ms. Allocated memory is still 117.4MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.98ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.25ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 71.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.95ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 744.82ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 51.3MB in the end (delta: 17.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 418328.34ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 50.8MB in the beginning and 62.1MB in the end (delta: -11.3MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. * Witness Printer took 97.03ms. Allocated memory is still 201.3MB. Free memory was 62.1MB in the beginning and 57.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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: 418.2s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 94.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 848 SdHoareTripleChecker+Valid, 38.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 848 mSDsluCounter, 7209 SdHoareTripleChecker+Invalid, 37.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2428 IncrementalHoareTripleChecker+Unchecked, 6167 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8978 IncrementalHoareTripleChecker+Invalid, 11569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 1042 mSDtfsCounter, 8978 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1594 GetRequests, 921 SyntacticMatches, 42 SemanticMatches, 631 ConstructedPredicates, 42 IntricatePredicates, 0 DeprecatedPredicates, 7144 ImplicationChecksByTransitivity, 229.1s 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.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 80 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 314.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-11-28 04:18:20,694 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-28 04:18:20,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ceabf60-d447-482c-a1b0-0114c432e34a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE