./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:52:43,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:52:43,642 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 18:52:43,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:52:43,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:52:43,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:52:43,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:52:43,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:52:43,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:52:43,681 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:52:43,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:52:43,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:52:43,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:52:43,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:52:43,688 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:52:43,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:52:43,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:52:43,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:52:43,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:52:43,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:52:43,691 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:52:43,695 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:52:43,695 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:52:43,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:52:43,696 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:52:43,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:52:43,697 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:52:43,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:52:43,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:52:43,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:52:43,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:52:43,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:52:43,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:52:43,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:52:43,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:52:43,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:52:43,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:52:43,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:52:43,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:52:43,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:52:43,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:52:43,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:52:43,706 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2024-11-08 18:52:44,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:52:44,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:52:44,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:52:44,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:52:44,072 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:52:44,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i Unable to find full path for "g++" [2024-11-08 18:52:46,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:52:46,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:52:46,557 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-11-08 18:52:46,575 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/data/f97f39c9d/6eae57bcc6f748788c55b197fc08335c/FLAGf7bef0dac [2024-11-08 18:52:46,854 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/data/f97f39c9d/6eae57bcc6f748788c55b197fc08335c [2024-11-08 18:52:46,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:52:46,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:52:46,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:52:46,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:52:46,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:52:46,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:52:46" (1/1) ... [2024-11-08 18:52:46,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7038f5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:46, skipping insertion in model container [2024-11-08 18:52:46,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:52:46" (1/1) ... [2024-11-08 18:52:46,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:52:47,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:52:47,324 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:52:47,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:52:47,435 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:52:47,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47 WrapperNode [2024-11-08 18:52:47,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:52:47,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:52:47,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:52:47,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:52:47,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,493 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 121 [2024-11-08 18:52:47,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:52:47,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:52:47,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:52:47,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:52:47,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,540 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-08 18:52:47,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:52:47,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:52:47,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:52:47,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:52:47,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (1/1) ... [2024-11-08 18:52:47,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:52:47,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:52:47,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:52:47,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:52:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:52:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:52:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:52:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:52:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:52:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:52:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 18:52:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 18:52:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 18:52:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 18:52:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:52:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:52:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:52:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:52:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:52:47,812 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:52:47,815 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:52:48,192 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-11-08 18:52:48,196 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:52:48,213 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:52:48,214 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:52:48,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:52:48 BoogieIcfgContainer [2024-11-08 18:52:48,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:52:48,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:52:48,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:52:48,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:52:48,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:52:46" (1/3) ... [2024-11-08 18:52:48,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef2d85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:52:48, skipping insertion in model container [2024-11-08 18:52:48,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:52:47" (2/3) ... [2024-11-08 18:52:48,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef2d85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:52:48, skipping insertion in model container [2024-11-08 18:52:48,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:52:48" (3/3) ... [2024-11-08 18:52:48,233 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2024-11-08 18:52:48,254 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:52:48,255 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-08 18:52:48,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:52:48,347 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;@54d339b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:52:48,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-08 18:52:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 48 states have (on average 1.75) internal successors, (84), 69 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 18:52:48,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:48,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:52:48,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash 889540587, now seen corresponding path program 1 times [2024-11-08 18:52:48,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651476146] [2024-11-08 18:52:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:48,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:48,709 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-08 18:52:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651476146] [2024-11-08 18:52:48,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651476146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:52:48,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:52:48,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:52:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489739922] [2024-11-08 18:52:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:52:48,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:52:48,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:48,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:52:48,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:52:48,760 INFO L87 Difference]: Start difference. First operand has 70 states, 48 states have (on average 1.75) internal successors, (84), 69 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-08 18:52:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:48,891 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-11-08 18:52:48,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:52:48,895 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-08 18:52:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:48,907 INFO L225 Difference]: With dead ends: 67 [2024-11-08 18:52:48,907 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 18:52:48,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:52:48,918 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:48,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:52:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 18:52:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 18:52:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 63 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-08 18:52:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2024-11-08 18:52:48,972 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 6 [2024-11-08 18:52:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:48,973 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2024-11-08 18:52:48,974 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-08 18:52:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2024-11-08 18:52:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 18:52:48,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:48,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:52:48,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:52:48,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:48,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash 889540588, now seen corresponding path program 1 times [2024-11-08 18:52:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855785302] [2024-11-08 18:52:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:49,196 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-08 18:52:49,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855785302] [2024-11-08 18:52:49,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855785302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:52:49,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:52:49,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:52:49,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061125732] [2024-11-08 18:52:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:52:49,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:52:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:52:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:52:49,203 INFO L87 Difference]: Start difference. First operand 64 states and 75 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-08 18:52:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:49,270 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-11-08 18:52:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:52:49,272 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-08 18:52:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:49,273 INFO L225 Difference]: With dead ends: 62 [2024-11-08 18:52:49,273 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 18:52:49,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:52:49,275 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:49,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:52:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 18:52:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 18:52:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 61 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-08 18:52:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-11-08 18:52:49,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 6 [2024-11-08 18:52:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:49,290 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-08 18:52:49,290 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-08 18:52:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-11-08 18:52:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 18:52:49,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:49,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:52:49,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:52:49,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:49,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash -745551576, now seen corresponding path program 1 times [2024-11-08 18:52:49,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:49,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164153829] [2024-11-08 18:52:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:49,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:49,419 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-08 18:52:49,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:49,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164153829] [2024-11-08 18:52:49,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164153829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:52:49,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:52:49,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:52:49,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268744520] [2024-11-08 18:52:49,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:52:49,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:52:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:49,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:52:49,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:52:49,427 INFO L87 Difference]: Start difference. First operand 62 states and 73 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-08 18:52:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:49,456 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2024-11-08 18:52:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:52:49,457 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-08 18:52:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:49,458 INFO L225 Difference]: With dead ends: 73 [2024-11-08 18:52:49,458 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 18:52:49,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:52:49,460 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 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-08 18:52:49,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:52:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 18:52:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2024-11-08 18:52:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 63 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-08 18:52:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2024-11-08 18:52:49,469 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 9 [2024-11-08 18:52:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:49,469 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2024-11-08 18:52:49,470 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-08 18:52:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2024-11-08 18:52:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 18:52:49,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:49,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:52:49,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:52:49,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:49,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1867404209, now seen corresponding path program 1 times [2024-11-08 18:52:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4936263] [2024-11-08 18:52:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:49,628 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-08 18:52:49,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4936263] [2024-11-08 18:52:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4936263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:52:49,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:52:49,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:52:49,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76095814] [2024-11-08 18:52:49,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:52:49,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:52:49,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:49,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:52:49,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:52:49,634 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:49,763 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-11-08 18:52:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:52:49,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 18:52:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:49,765 INFO L225 Difference]: With dead ends: 63 [2024-11-08 18:52:49,765 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 18:52:49,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:52:49,767 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:49,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:52:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 18:52:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-08 18:52:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.574468085106383) internal successors, (74), 62 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-08 18:52:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2024-11-08 18:52:49,774 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 10 [2024-11-08 18:52:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:49,774 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2024-11-08 18:52:49,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-11-08 18:52:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 18:52:49,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:49,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:52:49,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:52:49,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:49,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:49,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1867404208, now seen corresponding path program 1 times [2024-11-08 18:52:49,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:49,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926199123] [2024-11-08 18:52:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:52:50,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:50,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926199123] [2024-11-08 18:52:50,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926199123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:52:50,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:52:50,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:52:50,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386531413] [2024-11-08 18:52:50,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:52:50,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:52:50,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:50,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:52:50,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:52:50,044 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:50,130 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-11-08 18:52:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:52:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 18:52:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:50,133 INFO L225 Difference]: With dead ends: 62 [2024-11-08 18:52:50,133 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 18:52:50,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:52:50,135 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:50,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 218 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:52:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 18:52:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 18:52:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.553191489361702) internal successors, (73), 61 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-08 18:52:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-11-08 18:52:50,144 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 10 [2024-11-08 18:52:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:50,148 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-08 18:52:50,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-11-08 18:52:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 18:52:50,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:50,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:52:50,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:52:50,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:50,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash 451406746, now seen corresponding path program 1 times [2024-11-08 18:52:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:50,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010354323] [2024-11-08 18:52:50,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:50,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:50,301 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-08 18:52:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:50,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010354323] [2024-11-08 18:52:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010354323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:52:50,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341039431] [2024-11-08 18:52:50,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:50,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:52:50,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:52:50,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:52:50,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:52:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:50,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:52:50,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:52:50,537 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-08 18:52:50,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:52:50,600 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-08 18:52:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341039431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:52:50,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:52:50,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-08 18:52:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876933322] [2024-11-08 18:52:50,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:52:50,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:52:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:50,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:52:50,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:52:50,606 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:50,639 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2024-11-08 18:52:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:52:50,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 18:52:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:50,644 INFO L225 Difference]: With dead ends: 70 [2024-11-08 18:52:50,644 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 18:52:50,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:52:50,645 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:50,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:52:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 18:52:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 18:52:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2024-11-08 18:52:50,658 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 18 [2024-11-08 18:52:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:50,658 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-11-08 18:52:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2024-11-08 18:52:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 18:52:50,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:50,659 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:52:50,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:52:50,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:52:50,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:50,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 541747560, now seen corresponding path program 2 times [2024-11-08 18:52:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384549399] [2024-11-08 18:52:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:52:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384549399] [2024-11-08 18:52:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384549399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:52:51,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:52:51,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:52:51,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607470644] [2024-11-08 18:52:51,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:52:51,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:52:51,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:52:51,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:52:51,047 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-08 18:52:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:51,137 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-11-08 18:52:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:52:51,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 18:52:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:51,138 INFO L225 Difference]: With dead ends: 101 [2024-11-08 18:52:51,138 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 18:52:51,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:52:51,140 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 130 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:51,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 167 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:52:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 18:52:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2024-11-08 18:52:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.4) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-11-08 18:52:51,146 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 27 [2024-11-08 18:52:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:51,146 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-11-08 18:52:51,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-08 18:52:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-11-08 18:52:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 18:52:51,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:51,147 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:52:51,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:52:51,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:51,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash -385705617, now seen corresponding path program 1 times [2024-11-08 18:52:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:51,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721039503] [2024-11-08 18:52:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:52:51,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721039503] [2024-11-08 18:52:51,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721039503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:52:51,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:52:51,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:52:51,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723369028] [2024-11-08 18:52:51,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:52:51,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:52:51,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:51,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:52:51,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:52:51,398 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-08 18:52:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:51,688 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2024-11-08 18:52:51,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:52:51,688 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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 28 [2024-11-08 18:52:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:51,689 INFO L225 Difference]: With dead ends: 79 [2024-11-08 18:52:51,689 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 18:52:51,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:52:51,691 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 49 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:51,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 310 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:52:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 18:52:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-08 18:52:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.421875) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2024-11-08 18:52:51,697 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 28 [2024-11-08 18:52:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:51,697 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2024-11-08 18:52:51,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-08 18:52:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2024-11-08 18:52:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 18:52:51,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:51,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:52:51,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:52:51,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:51,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash -385705616, now seen corresponding path program 1 times [2024-11-08 18:52:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131334430] [2024-11-08 18:52:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 18:52:52,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:52,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131334430] [2024-11-08 18:52:52,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131334430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:52:52,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:52:52,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:52:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144165857] [2024-11-08 18:52:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:52:52,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:52:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:52,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:52:52,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:52:52,108 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-08 18:52:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:52,428 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2024-11-08 18:52:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:52:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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-08 18:52:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:52,430 INFO L225 Difference]: With dead ends: 79 [2024-11-08 18:52:52,432 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 18:52:52,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:52:52,433 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 47 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:52,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 350 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:52:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 18:52:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-08 18:52:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.390625) internal successors, (89), 78 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2024-11-08 18:52:52,443 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 28 [2024-11-08 18:52:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:52,447 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2024-11-08 18:52:52,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-08 18:52:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2024-11-08 18:52:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 18:52:52,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:52,448 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:52:52,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:52:52,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:52,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:52,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1518490384, now seen corresponding path program 1 times [2024-11-08 18:52:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:52,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356237662] [2024-11-08 18:52:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:52,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:52:53,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:53,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356237662] [2024-11-08 18:52:53,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356237662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:52:53,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439515962] [2024-11-08 18:52:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:53,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:52:53,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:52:53,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:52:53,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:52:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:53,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 18:52:53,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:52:53,889 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-08 18:52:53,973 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 18:52:53,974 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-08 18:52:54,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:52:54,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 18:52:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:52:54,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:52:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:52:55,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439515962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:52:55,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:52:55,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 33 [2024-11-08 18:52:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412639779] [2024-11-08 18:52:55,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:52:55,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 18:52:55,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 18:52:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 18:52:55,033 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 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-08 18:52:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:56,062 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2024-11-08 18:52:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:52:56,063 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-08 18:52:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:56,065 INFO L225 Difference]: With dead ends: 98 [2024-11-08 18:52:56,066 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 18:52:56,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=1601, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 18:52:56,067 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 53 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:56,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 952 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:52:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 18:52:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2024-11-08 18:52:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 85 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:52:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-11-08 18:52:56,078 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 31 [2024-11-08 18:52:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:56,078 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-11-08 18:52:56,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 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-08 18:52:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-11-08 18:52:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 18:52:56,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:56,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:52:56,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:52:56,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:52:56,284 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:52:56,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:56,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1518490383, now seen corresponding path program 1 times [2024-11-08 18:52:56,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:56,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264892231] [2024-11-08 18:52:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:52:57,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:57,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264892231] [2024-11-08 18:52:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264892231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:52:57,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564845013] [2024-11-08 18:52:57,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:57,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:52:57,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:52:57,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:52:57,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:52:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:57,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 18:52:57,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:52:57,614 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-08 18:52:57,763 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:52:57,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 18:52:57,774 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-08 18:52:57,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 18:52:57,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:52:58,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 18:52:58,334 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-08 18:52:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:52:58,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:52:59,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:52:59,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-11-08 18:52:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:52:59,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564845013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:52:59,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:52:59,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 40 [2024-11-08 18:52:59,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89318434] [2024-11-08 18:52:59,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:52:59,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-08 18:52:59,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-08 18:52:59,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1529, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 18:52:59,643 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 41 states, 40 states have (on average 2.075) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:01,419 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2024-11-08 18:53:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 18:53:01,420 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.075) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-08 18:53:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:01,421 INFO L225 Difference]: With dead ends: 136 [2024-11-08 18:53:01,421 INFO L226 Difference]: Without dead ends: 136 [2024-11-08 18:53:01,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=241, Invalid=2621, Unknown=0, NotChecked=0, Total=2862 [2024-11-08 18:53:01,423 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 108 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:01,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1072 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:53:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-08 18:53:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 95. [2024-11-08 18:53:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.4) internal successors, (112), 94 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2024-11-08 18:53:01,437 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 31 [2024-11-08 18:53:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:01,437 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2024-11-08 18:53:01,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.075) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2024-11-08 18:53:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 18:53:01,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:01,438 INFO L215 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] [2024-11-08 18:53:01,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:53:01,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:01,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:01,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:01,640 INFO L85 PathProgramCache]: Analyzing trace with hash 282324088, now seen corresponding path program 2 times [2024-11-08 18:53:01,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:01,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261421166] [2024-11-08 18:53:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 18:53:01,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:01,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261421166] [2024-11-08 18:53:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261421166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:01,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059624922] [2024-11-08 18:53:01,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:53:01,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:01,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:01,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:01,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:53:01,984 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:53:01,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:53:01,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:53:01,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:53:02,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:53:02,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059624922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:02,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:53:02,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-11-08 18:53:02,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825435841] [2024-11-08 18:53:02,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:02,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:53:02,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:02,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:53:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:53:02,055 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-08 18:53:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:02,123 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2024-11-08 18:53:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:53:02,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 35 [2024-11-08 18:53:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:02,125 INFO L225 Difference]: With dead ends: 78 [2024-11-08 18:53:02,126 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 18:53:02,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 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-08 18:53:02,127 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 82 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:02,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 179 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:53:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 18:53:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-08 18:53:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-08 18:53:02,131 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 35 [2024-11-08 18:53:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:02,135 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-08 18:53:02,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-08 18:53:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-08 18:53:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:53:02,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:02,137 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:02,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 18:53:02,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:02,338 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:02,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash 994931166, now seen corresponding path program 1 times [2024-11-08 18:53:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:02,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654925658] [2024-11-08 18:53:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 18:53:02,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:02,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654925658] [2024-11-08 18:53:02,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654925658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:02,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:02,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:53:02,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241487096] [2024-11-08 18:53:02,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:02,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:53:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:02,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:53:02,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:53:02,543 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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-08 18:53:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:02,795 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2024-11-08 18:53:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:53:02,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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 38 [2024-11-08 18:53:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:02,797 INFO L225 Difference]: With dead ends: 82 [2024-11-08 18:53:02,797 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 18:53:02,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:53:02,798 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:02,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 284 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:53:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 18:53:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 18:53:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 81 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-08 18:53:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2024-11-08 18:53:02,810 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 38 [2024-11-08 18:53:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:02,811 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2024-11-08 18:53:02,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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-08 18:53:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2024-11-08 18:53:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:53:02,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:02,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:02,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:53:02,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:02,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash 994931167, now seen corresponding path program 1 times [2024-11-08 18:53:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:02,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688501897] [2024-11-08 18:53:02,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:02,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:53:02,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:02,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688501897] [2024-11-08 18:53:02,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688501897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:02,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216003195] [2024-11-08 18:53:02,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:02,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:02,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:02,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:02,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:53:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:03,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:53:03,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:53:03,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:53:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:53:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216003195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:53:03,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:53:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-08 18:53:03,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570483210] [2024-11-08 18:53:03,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:53:03,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:53:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:53:03,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:53:03,227 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-08 18:53:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:03,307 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2024-11-08 18:53:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:53:03,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-08 18:53:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:03,309 INFO L225 Difference]: With dead ends: 106 [2024-11-08 18:53:03,309 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 18:53:03,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:53:03,310 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 126 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:03,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 177 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:53:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 18:53:03,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-08 18:53:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 97 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-08 18:53:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2024-11-08 18:53:03,314 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 38 [2024-11-08 18:53:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:03,314 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2024-11-08 18:53:03,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-08 18:53:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2024-11-08 18:53:03,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 18:53:03,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:03,315 INFO L215 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] [2024-11-08 18:53:03,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:53:03,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 18:53:03,516 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:03,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:03,516 INFO L85 PathProgramCache]: Analyzing trace with hash -360708028, now seen corresponding path program 1 times [2024-11-08 18:53:03,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:03,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36312357] [2024-11-08 18:53:03,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 18:53:03,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:03,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36312357] [2024-11-08 18:53:03,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36312357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:03,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110210901] [2024-11-08 18:53:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:03,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:03,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:03,714 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:03,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:53:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:03,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:53:03,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:53:03,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:53:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:53:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110210901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:53:04,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:53:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-08 18:53:04,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078685608] [2024-11-08 18:53:04,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:53:04,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:53:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:04,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:53:04,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:53:04,031 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:04,120 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2024-11-08 18:53:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:53:04,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-08 18:53:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:04,122 INFO L225 Difference]: With dead ends: 100 [2024-11-08 18:53:04,122 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 18:53:04,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:53:04,123 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:04,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 274 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:53:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 18:53:04,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2024-11-08 18:53:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 91 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-08 18:53:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2024-11-08 18:53:04,126 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 40 [2024-11-08 18:53:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:04,127 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2024-11-08 18:53:04,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:04,127 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2024-11-08 18:53:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 18:53:04,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:04,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:04,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 18:53:04,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:04,329 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash -20696429, now seen corresponding path program 2 times [2024-11-08 18:53:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:04,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854346340] [2024-11-08 18:53:04,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:04,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 18:53:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:04,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854346340] [2024-11-08 18:53:04,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854346340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:04,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650675955] [2024-11-08 18:53:04,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:53:04,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:04,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:04,520 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:04,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:53:04,661 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 18:53:04,662 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:53:04,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:53:04,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 18:53:04,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:53:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650675955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:04,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:53:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-08 18:53:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906324963] [2024-11-08 18:53:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:04,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:53:04,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:04,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:53:04,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:53:04,756 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-08 18:53:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:04,828 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-08 18:53:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:53:04,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-08 18:53:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:04,830 INFO L225 Difference]: With dead ends: 99 [2024-11-08 18:53:04,830 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 18:53:04,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:53:04,831 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 93 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:04,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 143 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:53:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 18:53:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2024-11-08 18:53:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.325) internal successors, (106), 90 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2024-11-08 18:53:04,836 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 43 [2024-11-08 18:53:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:04,836 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2024-11-08 18:53:04,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-08 18:53:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2024-11-08 18:53:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 18:53:04,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:04,838 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:04,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 18:53:05,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 18:53:05,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:05,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash -641600088, now seen corresponding path program 1 times [2024-11-08 18:53:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:05,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71335242] [2024-11-08 18:53:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:53:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:05,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71335242] [2024-11-08 18:53:05,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71335242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:05,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:05,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:53:05,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058956709] [2024-11-08 18:53:05,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:05,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:53:05,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:05,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:53:05,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:53:05,407 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 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-08 18:53:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:05,672 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-08 18:53:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:53:05,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 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-08 18:53:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:05,674 INFO L225 Difference]: With dead ends: 91 [2024-11-08 18:53:05,674 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 18:53:05,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:53:05,675 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:05,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 305 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:53:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 18:53:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-08 18:53:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.2875) internal successors, (103), 90 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-08 18:53:05,680 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 44 [2024-11-08 18:53:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:05,682 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-08 18:53:05,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 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-08 18:53:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-08 18:53:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 18:53:05,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:05,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:05,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:53:05,684 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:05,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1303721574, now seen corresponding path program 1 times [2024-11-08 18:53:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:05,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387617715] [2024-11-08 18:53:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 18:53:07,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:07,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387617715] [2024-11-08 18:53:07,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387617715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:07,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040321415] [2024-11-08 18:53:07,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:07,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:07,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:07,049 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:07,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:53:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:07,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-08 18:53:07,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:07,294 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-08 18:53:07,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:53:07,360 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-08 18:53:07,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:53:07,731 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:53:07,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 18:53:07,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:53:07,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-08 18:53:07,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 18:53:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 18:53:07,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:53:13,325 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-08 18:53:13,325 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-08 18:53:13,903 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-08 18:53:13,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040321415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:53:13,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:53:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 45 [2024-11-08 18:53:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643950613] [2024-11-08 18:53:13,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:53:13,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-08 18:53:13,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-08 18:53:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1897, Unknown=40, NotChecked=0, Total=2070 [2024-11-08 18:53:13,906 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-08 18:53:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:15,996 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2024-11-08 18:53:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 18:53:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 0 states have call successors, (0), 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-08 18:53:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:15,998 INFO L225 Difference]: With dead ends: 108 [2024-11-08 18:53:15,998 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 18:53:15,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=267, Invalid=3233, Unknown=40, NotChecked=0, Total=3540 [2024-11-08 18:53:16,001 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 113 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:16,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1343 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:53:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 18:53:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2024-11-08 18:53:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 100 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2024-11-08 18:53:16,006 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 47 [2024-11-08 18:53:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:16,006 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2024-11-08 18:53:16,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-08 18:53:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2024-11-08 18:53:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 18:53:16,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:16,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:16,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 18:53:16,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 18:53:16,209 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:16,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1303721573, now seen corresponding path program 1 times [2024-11-08 18:53:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906032061] [2024-11-08 18:53:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 18:53:18,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906032061] [2024-11-08 18:53:18,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906032061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:18,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433679747] [2024-11-08 18:53:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:18,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:18,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:18,125 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:18,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:53:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:18,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-08 18:53:18,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:18,388 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-08 18:53:18,399 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-08 18:53:18,710 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:53:18,711 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-08 18:53:18,725 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-08 18:53:18,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 18:53:18,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:53:19,704 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:53:19,704 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 62 treesize of output 57 [2024-11-08 18:53:19,716 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-08 18:53:19,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:53:19,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-11-08 18:53:19,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:53:19,896 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 25 treesize of output 13 [2024-11-08 18:53:20,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 18:53:20,055 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-08 18:53:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:53:20,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:53:20,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1048 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1048 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1048)) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1048) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_1048 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1048 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1048)) (forall ((v_ArrVal_1047 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1048) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1047)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))))) is different from false [2024-11-08 18:53:20,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-08 18:53:20,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2024-11-08 18:53:20,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2024-11-08 18:53:20,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) is different from false [2024-11-08 18:53:20,930 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))))))) is different from false [2024-11-08 18:53:20,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:53:20,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1044 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:53:20,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:20,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-08 18:53:20,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:20,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-08 18:53:21,002 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 62 treesize of output 50 [2024-11-08 18:53:21,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-08 18:53:21,023 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 15 treesize of output 11 [2024-11-08 18:53:21,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:53:21,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:21,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-08 18:53:21,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:53:21,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:53:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 9 not checked. [2024-11-08 18:53:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433679747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:53:22,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:53:22,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 58 [2024-11-08 18:53:22,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862852550] [2024-11-08 18:53:22,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:53:22,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-08 18:53:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:22,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-08 18:53:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2421, Unknown=8, NotChecked=840, Total=3422 [2024-11-08 18:53:22,011 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 59 states, 58 states have (on average 2.2586206896551726) internal successors, (131), 59 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-08 18:53:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:25,862 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2024-11-08 18:53:25,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 18:53:25,863 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.2586206896551726) internal successors, (131), 59 states have internal predecessors, (131), 0 states have call successors, (0), 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-08 18:53:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:25,864 INFO L225 Difference]: With dead ends: 108 [2024-11-08 18:53:25,866 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 18:53:25,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=316, Invalid=4130, Unknown=8, NotChecked=1096, Total=5550 [2024-11-08 18:53:25,869 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 122 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 601 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:25,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1770 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1610 Invalid, 0 Unknown, 601 Unchecked, 1.9s Time] [2024-11-08 18:53:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 18:53:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2024-11-08 18:53:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 99 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-08 18:53:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2024-11-08 18:53:25,878 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 47 [2024-11-08 18:53:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:25,879 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2024-11-08 18:53:25,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.2586206896551726) internal successors, (131), 59 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-08 18:53:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2024-11-08 18:53:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 18:53:25,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:25,880 INFO L215 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] [2024-11-08 18:53:25,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 18:53:26,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:26,084 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:26,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2095145822, now seen corresponding path program 2 times [2024-11-08 18:53:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:26,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066668702] [2024-11-08 18:53:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 18:53:26,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:26,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066668702] [2024-11-08 18:53:26,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066668702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:26,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:26,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:53:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606031289] [2024-11-08 18:53:26,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:26,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:53:26,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:53:26,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:53:26,234 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-08 18:53:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:26,294 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-11-08 18:53:26,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:53:26,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-08 18:53:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:26,296 INFO L225 Difference]: With dead ends: 82 [2024-11-08 18:53:26,296 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 18:53:26,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:53:26,298 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:26,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 117 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:53:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 18:53:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 18:53:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-08 18:53:26,305 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 51 [2024-11-08 18:53:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:26,305 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-08 18:53:26,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-08 18:53:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-08 18:53:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 18:53:26,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:26,306 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:26,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:53:26,307 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:26,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1700608379, now seen corresponding path program 1 times [2024-11-08 18:53:26,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:26,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898154340] [2024-11-08 18:53:26,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:28,480 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-08 18:53:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898154340] [2024-11-08 18:53:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898154340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642113293] [2024-11-08 18:53:28,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:28,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:28,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:28,483 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:28,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 18:53:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:28,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-08 18:53:28,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:28,715 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-08 18:53:28,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:53:28,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 18:53:29,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:53:29,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:53:29,780 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:53:29,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-08 18:53:29,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-11-08 18:53:29,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-08 18:53:30,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:53:30,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2024-11-08 18:53:30,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-08 18:53:30,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:53:30,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2024-11-08 18:53:30,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-08 18:53:30,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-08 18:53:30,539 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:53:30,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:30,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-08 18:53:30,686 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-08 18:53:30,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:53:31,235 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1212 Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_19| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (or (not (= v_ArrVal_1214 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1214 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_19| 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_19|) (= (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1213) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1212)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_19|) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from false [2024-11-08 18:53:31,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:31,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:53:31,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:31,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 68 [2024-11-08 18:53:31,698 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-08 18:53:31,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1210 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1210) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (and (or (= (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) .cse0) (or .cse0 (< |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)) (or (forall ((v_ArrVal_1208 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1208) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_main_~s~0#1.base|))) .cse0) (or (forall ((v_ArrVal_1208 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1208) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) .cse0) (forall ((v_ArrVal_1210 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1210) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse2 0) (< .cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)))))))) is different from false [2024-11-08 18:53:31,824 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (forall ((v_ArrVal_1210 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1210) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (and (forall ((v_ArrVal_1210 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1210) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse0 0) (< .cse0 (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))))) (or (< |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1) .cse2) (or .cse2 (forall ((v_ArrVal_1208 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1208) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) (or (= (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) .cse2) (or .cse2 (forall ((v_ArrVal_1208 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1208) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) is different from false [2024-11-08 18:53:32,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse4)) (.cse0 (forall ((v_ArrVal_1210 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1210) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse4) 0)))) (and (or .cse0 (< .cse1 1)) (forall ((v_ArrVal_1210 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1210) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse4))) (or (< .cse2 0) (< .cse2 (+ 1 .cse1))))) (or (forall ((v_ArrVal_1208 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1208) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) .cse0) (or .cse0 (forall ((v_ArrVal_1208 (Array Int Int))) (= .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1208) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse4)))))))) is different from false [2024-11-08 18:53:32,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (let ((.cse1 (forall ((v_ArrVal_1210 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1210) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) 0))) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (and (or (< .cse0 1) .cse1) (or (forall ((v_ArrVal_1208 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1208) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) .cse1) (or (forall ((v_ArrVal_1208 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1208) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) .cse2)) .cse1) (forall ((v_ArrVal_1210 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1210) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (or (< .cse4 0) (< .cse4 (+ .cse0 1))))))))) is different from false [2024-11-08 18:53:32,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:32,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-08 18:53:32,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:32,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-08 18:53:32,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-08 18:53:32,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:53:32,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-11-08 18:53:32,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 18:53:32,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:32,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-08 18:53:32,796 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:53:32,798 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 20 treesize of output 8 [2024-11-08 18:53:32,809 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-08 18:53:32,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-08 18:53:32,816 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 18:53:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-08 18:53:33,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642113293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:53:33,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:53:33,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 28] total 75 [2024-11-08 18:53:33,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897869392] [2024-11-08 18:53:33,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:53:33,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-08 18:53:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:33,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-08 18:53:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4541, Unknown=69, NotChecked=700, Total=5550 [2024-11-08 18:53:33,479 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 75 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 75 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:37,754 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-08 18:53:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 18:53:37,755 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 75 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-08 18:53:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:37,756 INFO L225 Difference]: With dead ends: 89 [2024-11-08 18:53:37,756 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 18:53:37,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=553, Invalid=7762, Unknown=77, NotChecked=920, Total=9312 [2024-11-08 18:53:37,759 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 185 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 441 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:37,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1619 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2068 Invalid, 0 Unknown, 441 Unchecked, 1.9s Time] [2024-11-08 18:53:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 18:53:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2024-11-08 18:53:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.16) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-08 18:53:37,763 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 53 [2024-11-08 18:53:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:37,764 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-08 18:53:37,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 75 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-08 18:53:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 18:53:37,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:37,765 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:37,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 18:53:37,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-08 18:53:37,966 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:37,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:37,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1652215463, now seen corresponding path program 1 times [2024-11-08 18:53:37,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:37,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730820172] [2024-11-08 18:53:37,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:37,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:53:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730820172] [2024-11-08 18:53:38,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730820172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590117486] [2024-11-08 18:53:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:38,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:38,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:38,702 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:38,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 18:53:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:38,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 18:53:38,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:39,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 18:53:39,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-08 18:53:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:53:39,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:53:39,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-08 18:53:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:53:39,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590117486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:53:39,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:53:39,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 22 [2024-11-08 18:53:39,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722719206] [2024-11-08 18:53:39,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:53:39,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:53:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:39,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:53:39,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:53:39,705 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:40,556 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-08 18:53:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:53:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-08 18:53:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:40,558 INFO L225 Difference]: With dead ends: 89 [2024-11-08 18:53:40,558 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 18:53:40,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 18:53:40,559 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 140 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:40,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 614 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:53:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 18:53:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-08 18:53:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-08 18:53:40,563 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 60 [2024-11-08 18:53:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:40,563 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-08 18:53:40,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-08 18:53:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 18:53:40,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:40,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:40,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 18:53:40,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-08 18:53:40,769 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:40,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1390246977, now seen corresponding path program 1 times [2024-11-08 18:53:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:40,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307335143] [2024-11-08 18:53:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 18:53:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:41,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307335143] [2024-11-08 18:53:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307335143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:41,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:53:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044315865] [2024-11-08 18:53:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:41,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:53:41,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:53:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:53:41,064 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:41,377 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-08 18:53:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:53:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-08 18:53:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:41,379 INFO L225 Difference]: With dead ends: 88 [2024-11-08 18:53:41,379 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 18:53:41,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:53:41,380 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:41,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 202 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:53:41,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 18:53:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-08 18:53:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 82 states have (on average 1.170731707317073) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-08 18:53:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-11-08 18:53:41,386 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 62 [2024-11-08 18:53:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:41,386 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-11-08 18:53:41,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-11-08 18:53:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 18:53:41,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:41,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:41,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 18:53:41,388 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:41,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1390246978, now seen corresponding path program 1 times [2024-11-08 18:53:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:41,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45049124] [2024-11-08 18:53:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 18:53:41,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45049124] [2024-11-08 18:53:41,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45049124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:41,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:41,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:53:41,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142325981] [2024-11-08 18:53:41,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:41,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:53:41,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:41,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:53:41,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:53:41,833 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:42,174 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-11-08 18:53:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:53:42,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-08 18:53:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:42,176 INFO L225 Difference]: With dead ends: 90 [2024-11-08 18:53:42,176 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 18:53:42,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:53:42,177 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:42,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 234 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:53:42,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 18:53:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 18:53:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2024-11-08 18:53:42,181 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 62 [2024-11-08 18:53:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:42,181 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2024-11-08 18:53:42,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2024-11-08 18:53:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 18:53:42,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:42,182 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:42,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 18:53:42,182 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:42,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1390263773, now seen corresponding path program 1 times [2024-11-08 18:53:42,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:42,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950960535] [2024-11-08 18:53:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:42,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 18:53:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950960535] [2024-11-08 18:53:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950960535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:42,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:53:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766716482] [2024-11-08 18:53:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:42,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:53:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:53:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:53:42,391 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:42,630 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-11-08 18:53:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:53:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-08 18:53:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:42,632 INFO L225 Difference]: With dead ends: 92 [2024-11-08 18:53:42,632 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 18:53:42,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:53:42,633 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:42,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 287 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:53:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 18:53:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-11-08 18:53:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.130952380952381) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-08 18:53:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-08 18:53:42,637 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 62 [2024-11-08 18:53:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:42,637 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-08 18:53:42,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-08 18:53:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 18:53:42,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:42,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:42,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 18:53:42,641 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:42,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash -410681503, now seen corresponding path program 2 times [2024-11-08 18:53:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:42,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924024102] [2024-11-08 18:53:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:42,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:53:42,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:42,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924024102] [2024-11-08 18:53:42,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924024102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:42,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353891054] [2024-11-08 18:53:42,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:53:42,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:42,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:42,961 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:42,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 18:53:43,272 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:53:43,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:53:43,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:53:43,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 18:53:43,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:53:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 18:53:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353891054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:53:43,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:53:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-08 18:53:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724194489] [2024-11-08 18:53:43,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:53:43,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:53:43,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:43,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:53:43,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:53:43,551 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-08 18:53:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:43,688 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-08 18:53:43,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:53:43,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 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 64 [2024-11-08 18:53:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:43,692 INFO L225 Difference]: With dead ends: 78 [2024-11-08 18:53:43,692 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 18:53:43,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:53:43,693 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 46 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:43,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 192 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:53:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 18:53:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-08 18:53:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-08 18:53:43,701 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 64 [2024-11-08 18:53:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:43,701 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-08 18:53:43,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-08 18:53:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-08 18:53:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 18:53:43,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:43,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:43,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 18:53:43,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-08 18:53:43,903 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:43,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 478149885, now seen corresponding path program 1 times [2024-11-08 18:53:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:43,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51567866] [2024-11-08 18:53:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 18:53:44,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:44,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51567866] [2024-11-08 18:53:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51567866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:44,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:44,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:53:44,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925932775] [2024-11-08 18:53:44,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:44,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:53:44,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:44,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:53:44,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:53:44,151 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-08 18:53:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:44,417 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-08 18:53:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:53:44,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-08 18:53:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:44,419 INFO L225 Difference]: With dead ends: 79 [2024-11-08 18:53:44,419 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 18:53:44,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:53:44,420 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:44,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 243 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:53:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 18:53:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-08 18:53:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-08 18:53:44,423 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 65 [2024-11-08 18:53:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:44,423 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-08 18:53:44,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-08 18:53:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-08 18:53:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 18:53:44,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:44,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:44,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 18:53:44,425 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1302715151, now seen corresponding path program 1 times [2024-11-08 18:53:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17405304] [2024-11-08 18:53:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 18:53:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17405304] [2024-11-08 18:53:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17405304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843638046] [2024-11-08 18:53:46,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:46,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:46,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:46,186 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:46,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 18:53:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:46,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-08 18:53:46,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:46,514 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:53:46,514 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-08 18:53:46,659 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-08 18:53:47,005 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 18:53:47,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-08 18:53:47,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:53:47,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 18:53:47,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:47,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-08 18:53:47,558 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-08 18:53:47,558 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-08 18:53:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:53:47,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:53:48,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:48,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2024-11-08 18:53:48,397 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_4) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_3) 4) |c_ULTIMATE.start_sll_update_at_~head#1.base|) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1741 Int) (v_ArrVal_1739 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1739) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1741) 4) |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2024-11-08 18:53:48,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1741 Int) (v_ArrVal_1739 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1739) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1741) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_4) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_3) 4)) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2))))) is different from false [2024-11-08 18:53:48,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| v_prenex_2) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_4) |c_ULTIMATE.start_sll_create_#res#1.base|) v_prenex_2 v_prenex_3) 4) .cse0))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1741 Int) (v_ArrVal_1739 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1739) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1741) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))))) is different from false [2024-11-08 18:53:49,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:49,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-08 18:53:49,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-11-08 18:53:49,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:49,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2024-11-08 18:53:49,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-08 18:53:49,412 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:53:49,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2024-11-08 18:53:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 4 not checked. [2024-11-08 18:53:49,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843638046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:53:49,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:53:49,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 50 [2024-11-08 18:53:49,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818133403] [2024-11-08 18:53:49,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:53:49,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-08 18:53:49,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-08 18:53:49,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2092, Unknown=4, NotChecked=282, Total=2550 [2024-11-08 18:53:49,548 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 51 states, 50 states have (on average 2.7) internal successors, (135), 51 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:51,426 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-11-08 18:53:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 18:53:51,427 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.7) internal successors, (135), 51 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-08 18:53:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:51,427 INFO L225 Difference]: With dead ends: 90 [2024-11-08 18:53:51,427 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 18:53:51,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=292, Invalid=3376, Unknown=4, NotChecked=360, Total=4032 [2024-11-08 18:53:51,429 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:51,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 715 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1335 Invalid, 0 Unknown, 216 Unchecked, 1.2s Time] [2024-11-08 18:53:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 18:53:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2024-11-08 18:53:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 82 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-11-08 18:53:51,433 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 69 [2024-11-08 18:53:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:51,433 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-11-08 18:53:51,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.7) internal successors, (135), 51 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-08 18:53:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 18:53:51,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:51,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:51,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 18:53:51,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-08 18:53:51,639 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:53:51,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1302715150, now seen corresponding path program 1 times [2024-11-08 18:53:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302894450] [2024-11-08 18:53:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:51,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:53:53,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:53,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302894450] [2024-11-08 18:53:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302894450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:53,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573461982] [2024-11-08 18:53:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:53,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:53,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:53,738 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:53,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 18:53:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:54,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-08 18:53:54,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:54,059 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-08 18:53:54,269 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:53:54,270 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-08 18:53:54,277 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-08 18:53:54,352 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-08 18:53:54,364 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-08 18:53:54,789 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 18:53:54,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-08 18:53:54,795 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-08 18:53:54,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:53:54,929 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-08 18:53:54,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:53:54,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 18:53:55,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:55,331 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-08 18:53:55,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:55,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-08 18:53:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:53:55,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:53:56,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1855 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1855) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (not (= v_ArrVal_1855 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1855 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1855 (Array Int Int))) (or (forall ((v_ArrVal_1856 Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1855) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1856)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (not (= v_ArrVal_1855 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1855 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2024-11-08 18:53:56,849 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1854 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 5)))) (forall ((v_ArrVal_1854 (Array Int Int)) (v_ArrVal_1853 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1856 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1853) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1856) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|)))) is different from false [2024-11-08 18:53:56,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1854 (Array Int Int)) (v_ArrVal_1853 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1856 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1853) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1856) 4))))) (forall ((v_ArrVal_1854 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 5)))))) is different from false [2024-11-08 18:53:56,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1854 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))) (forall ((v_ArrVal_1854 (Array Int Int)) (v_ArrVal_1853 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1856 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1853) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1856) 4))))))) is different from false [2024-11-08 18:53:57,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1854 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 5)))) (forall ((v_ArrVal_1854 (Array Int Int)) (v_ArrVal_1853 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1856 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1853) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1856) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))))) is different from false [2024-11-08 18:53:57,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (forall ((v_ArrVal_1854 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 5)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))) (forall ((v_ArrVal_1854 (Array Int Int)) (v_ArrVal_1853 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_ArrVal_1856 Int)) (or (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1853) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1856) 4))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))))) is different from false [2024-11-08 18:53:57,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:57,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2024-11-08 18:53:57,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:57,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-08 18:53:57,379 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 66 treesize of output 62 [2024-11-08 18:53:57,386 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 112 treesize of output 106 [2024-11-08 18:53:57,397 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 40 treesize of output 38 [2024-11-08 18:53:57,412 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 47 treesize of output 45 [2024-11-08 18:53:57,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:57,435 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 52 [2024-11-08 18:53:57,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:57,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2024-11-08 18:53:57,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:53:57,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-08 18:53:57,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:53:57,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-08 18:53:57,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:53:57,572 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 14 treesize of output 10 [2024-11-08 18:53:58,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 18:53:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2024-11-08 18:53:58,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573461982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:53:58,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:53:58,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 57 [2024-11-08 18:53:58,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103106291] [2024-11-08 18:53:58,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:53:58,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-08 18:53:58,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:58,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-08 18:53:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2439, Unknown=45, NotChecked=630, Total=3306 [2024-11-08 18:53:58,388 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 58 states, 57 states have (on average 2.789473684210526) internal successors, (159), 58 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-08 18:54:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:54:00,891 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-11-08 18:54:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 18:54:00,892 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.789473684210526) internal successors, (159), 58 states have internal predecessors, (159), 0 states have call successors, (0), 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 69 [2024-11-08 18:54:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:54:00,893 INFO L225 Difference]: With dead ends: 92 [2024-11-08 18:54:00,893 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 18:54:00,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=310, Invalid=3695, Unknown=51, NotChecked=774, Total=4830 [2024-11-08 18:54:00,895 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:54:00,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 835 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1413 Invalid, 0 Unknown, 439 Unchecked, 1.3s Time] [2024-11-08 18:54:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 18:54:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2024-11-08 18:54:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.1375) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:54:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-08 18:54:00,899 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 69 [2024-11-08 18:54:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:54:00,900 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-08 18:54:00,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.789473684210526) internal successors, (159), 58 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-08 18:54:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-08 18:54:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 18:54:00,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:54:00,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:54:00,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-08 18:54:01,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-08 18:54:01,102 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:54:01,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:54:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1302698355, now seen corresponding path program 1 times [2024-11-08 18:54:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:54:01,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31910420] [2024-11-08 18:54:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:54:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:54:02,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:54:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31910420] [2024-11-08 18:54:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31910420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:54:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628963376] [2024-11-08 18:54:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:02,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:54:02,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:54:02,907 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:54:02,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 18:54:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:03,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-08 18:54:03,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:54:03,907 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-08 18:54:04,706 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-08 18:54:04,706 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 55 treesize of output 54 [2024-11-08 18:54:04,719 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 36 treesize of output 26 [2024-11-08 18:54:05,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:54:05,034 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 69 treesize of output 45 [2024-11-08 18:54:05,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:05,834 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 63 treesize of output 49 [2024-11-08 18:54:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:54:06,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:54:09,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:09,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-08 18:54:09,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-11-08 18:54:09,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:09,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2024-11-08 18:54:09,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-08 18:54:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:54:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628963376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:54:10,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:54:10,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 25] total 73 [2024-11-08 18:54:10,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867294834] [2024-11-08 18:54:10,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:54:10,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-08 18:54:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:54:10,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-08 18:54:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4954, Unknown=26, NotChecked=0, Total=5256 [2024-11-08 18:54:10,663 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 73 states, 73 states have (on average 2.5205479452054793) internal successors, (184), 73 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-08 18:54:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:54:15,229 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2024-11-08 18:54:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-08 18:54:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.5205479452054793) internal successors, (184), 73 states have internal predecessors, (184), 0 states have call successors, (0), 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 69 [2024-11-08 18:54:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:54:15,231 INFO L225 Difference]: With dead ends: 149 [2024-11-08 18:54:15,231 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 18:54:15,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1908 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=595, Invalid=10507, Unknown=28, NotChecked=0, Total=11130 [2024-11-08 18:54:15,233 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 153 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:54:15,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1023 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1764 Invalid, 2 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 18:54:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 18:54:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 85. [2024-11-08 18:54:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.1125) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:54:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-08 18:54:15,236 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 69 [2024-11-08 18:54:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:54:15,237 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-08 18:54:15,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.5205479452054793) internal successors, (184), 73 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-08 18:54:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-08 18:54:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 18:54:15,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:54:15,238 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:54:15,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-08 18:54:15,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:54:15,439 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:54:15,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:54:15,439 INFO L85 PathProgramCache]: Analyzing trace with hash 137516621, now seen corresponding path program 1 times [2024-11-08 18:54:15,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:54:15,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655048523] [2024-11-08 18:54:15,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:15,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:54:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:54:16,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:54:16,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655048523] [2024-11-08 18:54:16,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655048523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:54:16,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315739961] [2024-11-08 18:54:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:17,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:54:17,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:54:17,002 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:54:17,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 18:54:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:17,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-08 18:54:17,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:54:17,337 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-08 18:54:17,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:54:17,441 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-08 18:54:17,499 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-08 18:54:17,741 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 18:54:17,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-08 18:54:17,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:54:17,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 18:54:18,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:18,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-08 18:54:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:54:18,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:54:18,702 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2081 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2079) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2081) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-08 18:54:19,010 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2081 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2079) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2081) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-08 18:54:19,024 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_81| Int) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2081 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2079) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_81| v_ArrVal_2081) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_81|))) is different from false [2024-11-08 18:54:19,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:19,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-08 18:54:19,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-08 18:54:19,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:19,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-11-08 18:54:19,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-08 18:54:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 1 not checked. [2024-11-08 18:54:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315739961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:54:19,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:54:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 46 [2024-11-08 18:54:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004930841] [2024-11-08 18:54:19,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:54:19,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 18:54:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:54:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 18:54:19,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1657, Unknown=88, NotChecked=258, Total=2162 [2024-11-08 18:54:19,682 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 47 states, 46 states have (on average 3.217391304347826) internal successors, (148), 47 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-08 18:54:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:54:21,372 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-08 18:54:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 18:54:21,373 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.217391304347826) internal successors, (148), 47 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-08 18:54:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:54:21,374 INFO L225 Difference]: With dead ends: 93 [2024-11-08 18:54:21,374 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 18:54:21,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=261, Invalid=2845, Unknown=98, NotChecked=336, Total=3540 [2024-11-08 18:54:21,375 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:54:21,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 844 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1237 Invalid, 0 Unknown, 215 Unchecked, 0.9s Time] [2024-11-08 18:54:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 18:54:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2024-11-08 18:54:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:54:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-08 18:54:21,378 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 72 [2024-11-08 18:54:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:54:21,378 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-08 18:54:21,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.217391304347826) internal successors, (148), 47 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-08 18:54:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-08 18:54:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 18:54:21,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:54:21,379 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:54:21,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-08 18:54:21,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:54:21,580 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:54:21,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:54:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1604277825, now seen corresponding path program 2 times [2024-11-08 18:54:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:54:21,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523977972] [2024-11-08 18:54:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:21,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:54:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:54:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:54:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523977972] [2024-11-08 18:54:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523977972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:54:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335384379] [2024-11-08 18:54:24,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:54:24,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:54:24,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:54:24,735 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:54:24,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 18:54:25,026 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:54:25,026 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:54:25,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-08 18:54:25,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:54:25,176 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-08 18:54:25,181 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-08 18:54:25,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:54:25,279 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-08 18:54:25,409 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-08 18:54:25,417 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-08 18:54:25,436 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-08 18:54:25,444 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-08 18:54:25,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:54:25,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:54:26,492 INFO L349 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2024-11-08 18:54:26,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 96 [2024-11-08 18:54:26,616 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2024-11-08 18:54:26,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 67 [2024-11-08 18:54:27,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:54:27,875 INFO L349 Elim1Store]: treesize reduction 156, result has 30.7 percent of original size [2024-11-08 18:54:27,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 168 treesize of output 181 [2024-11-08 18:54:27,986 INFO L349 Elim1Store]: treesize reduction 60, result has 46.4 percent of original size [2024-11-08 18:54:27,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 162 [2024-11-08 18:54:29,166 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-08 18:54:29,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 18:54:29,252 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:54:29,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2024-11-08 18:54:29,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:29,305 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 39 treesize of output 41 [2024-11-08 18:54:29,669 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-08 18:54:29,700 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:54:29,700 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 39 treesize of output 1 [2024-11-08 18:54:29,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 7 treesize of output 3 [2024-11-08 18:54:41,342 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-08 18:54:41,517 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-08 18:54:41,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 43 [2024-11-08 18:54:41,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:41,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-08 18:54:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 18:54:41,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:54:41,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 18:54:45,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (forall ((v_ArrVal_2199 Int) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2200)) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2200) .cse2) 4) 0)))) (forall ((v_ArrVal_2199 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) (= (select (select .cse5 .cse4) 4) 0)))))))) is different from false [2024-11-08 18:54:45,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2199 Int) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2200)) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2200) .cse0) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2199 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse4) (= (select (select .cse5 .cse4) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))) is different from false [2024-11-08 18:54:45,906 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2199 Int) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (not (= v_ArrVal_2200 (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2200) .cse0) 4) 0)))) (forall ((v_ArrVal_2199 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= 0 (select (select .cse5 .cse4) 4))))))))) is different from false [2024-11-08 18:54:45,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (forall ((v_ArrVal_2199 Int) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2200) .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)) v_ArrVal_2200))))) (forall ((v_ArrVal_2199 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select .cse5 .cse4) 4) 0)))))))) is different from false [2024-11-08 18:54:46,038 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse10)) (.cse4 (select .cse10 4)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse1 (select .cse8 4)) (.cse5 (select .cse3 .cse4))) (and (forall ((v_ArrVal_2199 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select .cse2 .cse0) 4) 0))))) (forall ((v_ArrVal_2199 Int) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse7 (select (select (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse8))) (or (= (select (select (store .cse6 .cse4 v_ArrVal_2200) .cse7) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7) (< .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2200 (store (select .cse6 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))))))) is different from false [2024-11-08 18:54:46,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse10)) (.cse1 (select .cse10 4)) (.cse6 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse6 4)) (.cse5 (select .cse4 .cse1))) (and (forall ((v_ArrVal_2199 Int) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse6)) (.cse2 (select (select (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (not (= v_ArrVal_2200 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= .cse2 |c_ULTIMATE.start_node_create_#res#1.base|) (= (select (select (store .cse0 .cse1 v_ArrVal_2200) .cse2) 4) 0) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2199 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse8 (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (= .cse7 |c_ULTIMATE.start_node_create_#res#1.base|) (= (select (select .cse8 .cse7) 4) 0) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))))))))) is different from false [2024-11-08 18:54:46,180 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse1 (select .cse10 4)) (.cse6 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse6 4)) (.cse5 (select .cse4 .cse1))) (and (forall ((v_ArrVal_2199 Int) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse6)) (.cse2 (select (select (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= v_ArrVal_2200 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse2) (= (select (select (store .cse0 .cse1 v_ArrVal_2200) .cse2) 4) 0) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (forall ((v_ArrVal_2199 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse8 (store .cse4 .cse1 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse7) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (= (select (select .cse8 .cse7) 4) 0)))))))))) is different from false [2024-11-08 18:54:46,251 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-08 18:54:46,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 158 [2024-11-08 18:54:46,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-08 18:54:46,671 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-08 18:54:46,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 118 [2024-11-08 18:54:46,732 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-08 18:54:46,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 180 [2024-11-08 18:54:47,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse5 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (or (forall ((v_ArrVal_2199 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse2 (select v_arrayElimArr_18 4))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (store .cse4 .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse1 .cse2 v_ArrVal_2200) .cse3) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse3) (< (select v_arrayElimArr_17 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2200 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (not (= (select v_arrayElimArr_17 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) .cse5) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (or (forall ((v_arrayElimArr_16 (Array Int Int))) (or (forall ((v_ArrVal_2199 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse6) (= (select (select .cse7 .cse6) 4) 0) (= (select (let ((.cse8 (let ((.cse10 (select v_arrayElimArr_16 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))) (or (and (forall ((v_ArrVal_2199 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18)) (.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17)) (.cse12 (select v_arrayElimArr_18 4))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse11 .cse12 v_ArrVal_2200) (select (select (store .cse13 .cse12 (store (select .cse13 .cse12) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse13 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (< (select v_arrayElimArr_17 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2200 (store (select .cse11 .cse12) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (not (= (select v_arrayElimArr_17 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2199 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse15 (select v_arrayElimArr_18 4))) (let ((.cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (store .cse17 .cse15 (store (select .cse17 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse14 .cse15 v_ArrVal_2200) .cse16) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse16) (< (select v_arrayElimArr_17 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2200 (store (select .cse14 .cse15) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (not (= (select v_arrayElimArr_17 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) .cse5) (or (forall ((v_ArrVal_2199 Int) (v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse19 (let ((.cse20 (select v_arrayElimArr_16 4))) (store .cse18 .cse20 (store (select .cse18 .cse20) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199))))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) .cse5) (or (forall ((v_ArrVal_2199 Int) (v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse21 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17)) (.cse22 (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18))) (store .cse23 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse23 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= v_ArrVal_2200 (store (select .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (= (select (select (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2200) .cse22) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse22) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_17 4))) (not (= (select v_arrayElimArr_18 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (not .cse5)) (or .cse5 (and (forall ((v_ArrVal_2199 Int) (v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse25 (let ((.cse26 (select v_arrayElimArr_16 4))) (store .cse24 .cse26 (store (select .cse24 .cse26) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199))))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (forall ((v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (or (forall ((v_ArrVal_2199 Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (let ((.cse28 (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse27) (= (select (select .cse28 .cse27) 4) 0) (= (select (let ((.cse29 (let ((.cse31 (select v_arrayElimArr_16 4))) (store .cse30 .cse31 (store (select .cse30 .cse31) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199))))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((v_ArrVal_2199 Int) (v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse32 (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse35 (select v_arrayElimArr_16 4))) (store .cse34 .cse35 (store (select .cse34 .cse35) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199))))) (let ((.cse33 (select (select .cse32 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select .cse32 .cse33) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse33))))))) (or (forall ((v_ArrVal_2199 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse38 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_18)) (.cse36 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17)) (.cse37 (select v_arrayElimArr_18 4))) (or (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse36 .cse37 v_ArrVal_2200) (select (select (store .cse38 .cse37 (store (select .cse38 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (< (select v_arrayElimArr_17 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|) (not (= v_ArrVal_2200 (store (select .cse36 .cse37) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| (select v_ArrVal_2200 |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|)))) (not (= (select v_arrayElimArr_17 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) .cse5) (or (forall ((v_ArrVal_2199 Int) (v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_91| Int)) (let ((.cse39 (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse42 (select v_arrayElimArr_16 4))) (store .cse41 .cse42 (store (select .cse41 .cse42) |v_ULTIMATE.start_sll_update_at_~head#1.offset_91| v_ArrVal_2199))))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select .cse39 .cse40) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse40) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_91|))))) .cse5))) is different from false [2024-11-08 18:54:49,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:49,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 282 treesize of output 223 [2024-11-08 18:54:49,636 INFO L349 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2024-11-08 18:54:49,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 897 treesize of output 831 [2024-11-08 18:54:49,762 INFO L349 Elim1Store]: treesize reduction 44, result has 63.3 percent of original size [2024-11-08 18:54:49,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 462 treesize of output 507 [2024-11-08 18:54:49,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 454 [2024-11-08 18:54:49,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:49,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 340 treesize of output 358 [2024-11-08 18:54:49,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:49,959 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 423 treesize of output 437 [2024-11-08 18:54:50,023 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-08 18:54:50,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 352 [2024-11-08 18:54:50,061 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 458 treesize of output 424 [2024-11-08 18:54:50,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 18:54:50,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:50,578 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 86 treesize of output 88 [2024-11-08 18:54:50,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:50,685 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 41 treesize of output 43 [2024-11-08 18:54:50,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:50,722 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 65 treesize of output 61 [2024-11-08 18:54:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2024-11-08 18:54:50,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335384379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:54:50,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:54:50,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 30] total 74 [2024-11-08 18:54:50,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232167227] [2024-11-08 18:54:50,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:54:50,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-08 18:54:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:54:50,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-08 18:54:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4045, Unknown=15, NotChecked=1080, Total=5402 [2024-11-08 18:54:50,783 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 74 states, 74 states have (on average 2.418918918918919) internal successors, (179), 74 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-08 18:54:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:54:55,312 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2024-11-08 18:54:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 18:54:55,312 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.418918918918919) internal successors, (179), 74 states have internal predecessors, (179), 0 states have call successors, (0), 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 76 [2024-11-08 18:54:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:54:55,313 INFO L225 Difference]: With dead ends: 151 [2024-11-08 18:54:55,313 INFO L226 Difference]: Without dead ends: 151 [2024-11-08 18:54:55,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 109 SyntacticMatches, 7 SemanticMatches, 86 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=390, Invalid=5947, Unknown=15, NotChecked=1304, Total=7656 [2024-11-08 18:54:55,314 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 75 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 632 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:54:55,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1500 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1699 Invalid, 0 Unknown, 632 Unchecked, 2.1s Time] [2024-11-08 18:54:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-08 18:54:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-11-08 18:54:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.083916083916084) internal successors, (155), 147 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-08 18:54:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2024-11-08 18:54:55,319 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 76 [2024-11-08 18:54:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:54:55,320 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2024-11-08 18:54:55,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.418918918918919) internal successors, (179), 74 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-08 18:54:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2024-11-08 18:54:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 18:54:55,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:54:55,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:54:55,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-08 18:54:55,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:54:55,522 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:54:55,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:54:55,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1604294621, now seen corresponding path program 2 times [2024-11-08 18:54:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:54:55,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346328513] [2024-11-08 18:54:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:55,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:54:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:54:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:54:57,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346328513] [2024-11-08 18:54:57,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346328513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:54:57,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893956924] [2024-11-08 18:54:57,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:54:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:54:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:54:57,399 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:54:57,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 18:54:57,693 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:54:57,693 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:54:57,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-08 18:54:57,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:54:57,801 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-08 18:54:57,802 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-08 18:54:58,028 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-08 18:54:58,611 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-11-08 18:54:58,611 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 53 treesize of output 54 [2024-11-08 18:54:58,620 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:54:58,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2024-11-08 18:54:59,000 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-08 18:54:59,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 59 [2024-11-08 18:54:59,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:54:59,879 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 69 treesize of output 59 [2024-11-08 18:55:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:55:00,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:55:01,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2316 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (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_2316) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-08 18:55:01,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2316 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) v_ArrVal_2316) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-08 18:55:01,574 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2316 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) v_ArrVal_2316) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-08 18:55:01,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2316 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) v_ArrVal_2316) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-08 18:55:01,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:55:01,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2024-11-08 18:55:01,611 INFO L349 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2024-11-08 18:55:01,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 73 [2024-11-08 18:55:01,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:55:01,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 107 [2024-11-08 18:55:01,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2024-11-08 18:55:50,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base| 0))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse4 (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_node_create_#res#1.offset| 0))) (and (or .cse0 (forall ((v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (or (= |c_ULTIMATE.start_node_create_#res#1.base| v_arrayElimCell_181) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse2 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse2 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse2 (select (store .cse1 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or .cse4 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse3 v_antiDerIndex_entry0_1)))) (or (forall ((v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (and .cse0 (not .cse4))) (or .cse0 (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse5 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse5 (select (store .cse1 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse5 (select (store .cse1 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))))))))) is different from false [2024-11-08 18:56:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 7 not checked. [2024-11-08 18:56:45,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893956924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:56:45,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:56:45,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 64 [2024-11-08 18:56:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450389574] [2024-11-08 18:56:45,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:56:45,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-08 18:56:45,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:56:45,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-08 18:56:45,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3334, Unknown=25, NotChecked=600, Total=4160 [2024-11-08 18:56:45,128 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand has 65 states, 64 states have (on average 2.890625) internal successors, (185), 65 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-08 18:56:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:56:49,571 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2024-11-08 18:56:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 18:56:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.890625) internal successors, (185), 65 states have internal predecessors, (185), 0 states have call successors, (0), 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 76 [2024-11-08 18:56:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:56:49,573 INFO L225 Difference]: With dead ends: 151 [2024-11-08 18:56:49,573 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 18:56:49,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 112 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 107.4s TimeCoverageRelationStatistics Valid=300, Invalid=4807, Unknown=25, NotChecked=720, Total=5852 [2024-11-08 18:56:49,574 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:56:49,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1248 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1650 Invalid, 0 Unknown, 415 Unchecked, 2.7s Time] [2024-11-08 18:56:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 18:56:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-08 18:56:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.1) internal successors, (99), 94 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:56:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-08 18:56:49,576 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 76 [2024-11-08 18:56:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:56:49,576 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-08 18:56:49,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.890625) internal successors, (185), 65 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-08 18:56:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-08 18:56:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 18:56:49,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:56:49,577 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:56:49,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-08 18:56:49,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-08 18:56:49,778 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-08 18:56:49,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:56:49,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1111075185, now seen corresponding path program 3 times [2024-11-08 18:56:49,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:56:49,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151251920] [2024-11-08 18:56:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:56:49,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:56:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 18:56:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:56:49,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151251920] [2024-11-08 18:56:49,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151251920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:56:49,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090389311] [2024-11-08 18:56:49,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:56:49,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:56:49,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:56:49,942 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:56:49,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-08 18:56:50,490 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 18:56:50,490 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:56:50,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:56:50,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:56:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 18:56:50,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:56:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090389311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:56:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:56:50,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-08 18:56:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158390483] [2024-11-08 18:56:50,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:56:50,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:56:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:56:50,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:56:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:56:50,566 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-08 18:56:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:56:50,588 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-11-08 18:56:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:56:50,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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) Word has length 85 [2024-11-08 18:56:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:56:50,590 INFO L225 Difference]: With dead ends: 21 [2024-11-08 18:56:50,590 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 18:56:50,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:56:50,591 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:56:50,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:56:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 18:56:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 18:56:50,592 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-08 18:56:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 18:56:50,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-11-08 18:56:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:56:50,593 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 18:56:50,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-08 18:56:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 18:56:50,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 18:56:50,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-08 18:56:50,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-08 18:56:50,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-08 18:56:50,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-08 18:56:50,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-08 18:56:50,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-08 18:56:50,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-08 18:56:50,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-08 18:56:50,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-08 18:56:50,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-08 18:56:50,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-08 18:56:50,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-08 18:56:50,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-08 18:56:50,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-08 18:56:50,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-08 18:56:50,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-08 18:56:50,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2024-11-08 18:56:50,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2024-11-08 18:56:50,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2024-11-08 18:56:50,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2024-11-08 18:56:50,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-08 18:56:50,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-08 18:56:50,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:56:50,802 INFO L407 BasicCegarLoop]: Path program histogram: [3, 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-08 18:56:50,804 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:56:50,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:56:50 BoogieIcfgContainer [2024-11-08 18:56:50,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:56:50,809 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:56:50,809 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:56:50,809 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:56:50,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:52:48" (3/4) ... [2024-11-08 18:56:50,813 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 18:56:50,829 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-08 18:56:50,831 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-08 18:56:50,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 18:56:50,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 18:56:50,951 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 18:56:50,951 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/witness.yml [2024-11-08 18:56:50,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:56:50,953 INFO L158 Benchmark]: Toolchain (without parser) took 244094.62ms. Allocated memory was 134.2MB in the beginning and 497.0MB in the end (delta: 362.8MB). Free memory was 95.6MB in the beginning and 344.5MB in the end (delta: -248.9MB). Peak memory consumption was 116.4MB. Max. memory is 16.1GB. [2024-11-08 18:56:50,953 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 134.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:56:50,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.42ms. Allocated memory is still 134.2MB. Free memory was 95.6MB in the beginning and 75.6MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 18:56:50,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.61ms. Allocated memory is still 134.2MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:56:50,954 INFO L158 Benchmark]: Boogie Preprocessor took 72.92ms. Allocated memory is still 134.2MB. Free memory was 73.5MB in the beginning and 70.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:56:50,954 INFO L158 Benchmark]: RCFGBuilder took 647.80ms. Allocated memory is still 134.2MB. Free memory was 70.4MB in the beginning and 50.4MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 18:56:50,954 INFO L158 Benchmark]: TraceAbstraction took 242586.86ms. Allocated memory was 134.2MB in the beginning and 497.0MB in the end (delta: 362.8MB). Free memory was 49.5MB in the beginning and 350.8MB in the end (delta: -301.4MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-11-08 18:56:50,954 INFO L158 Benchmark]: Witness Printer took 142.87ms. Allocated memory is still 497.0MB. Free memory was 350.8MB in the beginning and 344.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:56:50,958 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.39ms. Allocated memory is still 134.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.42ms. Allocated memory is still 134.2MB. Free memory was 95.6MB in the beginning and 75.6MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.61ms. Allocated memory is still 134.2MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.92ms. Allocated memory is still 134.2MB. Free memory was 73.5MB in the beginning and 70.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 647.80ms. Allocated memory is still 134.2MB. Free memory was 70.4MB in the beginning and 50.4MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 242586.86ms. Allocated memory was 134.2MB in the beginning and 497.0MB in the end (delta: 362.8MB). Free memory was 49.5MB in the beginning and 350.8MB in the end (delta: -301.4MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 142.87ms. Allocated memory is still 497.0MB. Free memory was 350.8MB in the beginning and 344.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 242.5s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 37.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1977 SdHoareTripleChecker+Valid, 19.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1977 mSDsluCounter, 18024 SdHoareTripleChecker+Invalid, 17.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2959 IncrementalHoareTripleChecker+Unchecked, 16413 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18757 IncrementalHoareTripleChecker+Invalid, 21910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 1611 mSDtfsCounter, 18757 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2527 GetRequests, 1519 SyntacticMatches, 51 SemanticMatches, 957 ConstructedPredicates, 38 IntricatePredicates, 1 DeprecatedPredicates, 11263 ImplicationChecksByTransitivity, 161.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=32, InterpolantAutomatonStates: 465, 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, 34 MinimizatonAttempts, 228 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 194.7s InterpolantComputationTime, 2554 NumberOfCodeBlocks, 2522 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 3345 ConstructedInterpolants, 312 QuantifiedInterpolants, 68500 SizeOfPredicates, 89 NumberOfNonLiveVariables, 6504 ConjunctsInSsa, 952 ConjunctsInUnsatCore, 69 InterpolantComputations, 18 PerfectInterpolantSequences, 942/1643 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 - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-08 18:56:51,173 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-08 18:56:51,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3eae9a-45e4-476f-967e-d675fa552180/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE