./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:49:13,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:49:13,340 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:49:13,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:49:13,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:49:13,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:49:13,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:49:13,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:49:13,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:49:13,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:49:13,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:49:13,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:49:13,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:49:13,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:49:13,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:49:13,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:49:13,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:49:13,403 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:49:13,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:49:13,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:49:13,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:49:13,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:49:13,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:49:13,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:49:13,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:49:13,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:49:13,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:49:13,405 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:49:13,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:49:13,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:49:13,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:49:13,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:49:13,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:49:13,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:49:13,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:49:13,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:49:13,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:49:13,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:49:13,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:49:13,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:49:13,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:49:13,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:49:13,409 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-11-13 14:49:13,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:49:13,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:49:13,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:49:13,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:49:13,827 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:49:13,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i Unable to find full path for "g++" [2024-11-13 14:49:15,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:49:16,382 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:49:16,383 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-13 14:49:16,398 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/data/56ff961da/22c3939070a549bb9fbef4409cbce02e/FLAGe1ecf6f21 [2024-11-13 14:49:16,415 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/data/56ff961da/22c3939070a549bb9fbef4409cbce02e [2024-11-13 14:49:16,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:49:16,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:49:16,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:49:16,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:49:16,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:49:16,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:49:16" (1/1) ... [2024-11-13 14:49:16,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4c53a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:16, skipping insertion in model container [2024-11-13 14:49:16,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:49:16" (1/1) ... [2024-11-13 14:49:16,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:49:16,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-13 14:49:16,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:49:16,976 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:49:17,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-13 14:49:17,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:49:17,142 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:49:17,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17 WrapperNode [2024-11-13 14:49:17,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:49:17,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:49:17,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:49:17,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:49:17,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,210 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2024-11-13 14:49:17,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:49:17,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:49:17,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:49:17,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:49:17,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,264 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-13 14:49:17,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:49:17,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:49:17,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:49:17,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:49:17,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (1/1) ... [2024-11-13 14:49:17,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:49:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:17,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:49:17,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:49:17,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:49:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:49:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:49:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:49:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:49:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:49:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 14:49:17,405 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 14:49:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:49:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:49:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:49:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:49:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:49:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:49:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:49:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:49:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:49:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:49:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:49:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:49:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 14:49:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:49:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:49:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:49:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:49:17,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:49:17,594 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:49:17,597 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:49:17,910 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-13 14:49:17,910 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:49:17,921 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:49:17,922 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 14:49:17,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:49:17 BoogieIcfgContainer [2024-11-13 14:49:17,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:49:17,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:49:17,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:49:17,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:49:17,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:49:16" (1/3) ... [2024-11-13 14:49:17,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41353831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:49:17, skipping insertion in model container [2024-11-13 14:49:17,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:17" (2/3) ... [2024-11-13 14:49:17,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41353831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:49:17, skipping insertion in model container [2024-11-13 14:49:17,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:49:17" (3/3) ... [2024-11-13 14:49:17,934 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-11-13 14:49:17,951 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:49:17,953 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_unequal.i that has 2 procedures, 27 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-13 14:49:18,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:49:18,046 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=LoopHeads, 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;@5fd169d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:49:18,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:49:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:49:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 14:49:18,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:18,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:18,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:18,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash -699840632, now seen corresponding path program 1 times [2024-11-13 14:49:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174090973] [2024-11-13 14:49:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:49:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174090973] [2024-11-13 14:49:18,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174090973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:18,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:49:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759816701] [2024-11-13 14:49:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:18,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:49:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:49:18,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:18,645 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:49:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:18,732 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-13 14:49:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:49:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-13 14:49:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:18,742 INFO L225 Difference]: With dead ends: 52 [2024-11-13 14:49:18,743 INFO L226 Difference]: Without dead ends: 24 [2024-11-13 14:49:18,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:18,750 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:18,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:49:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-13 14:49:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-13 14:49:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:49:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-13 14:49:18,794 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-11-13 14:49:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:18,795 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-13 14:49:18,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:49:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-13 14:49:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 14:49:18,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:18,797 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:18,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:49:18,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:18,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash 380631264, now seen corresponding path program 1 times [2024-11-13 14:49:18,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:18,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80525426] [2024-11-13 14:49:18,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:18,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:19,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 14:49:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:49:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80525426] [2024-11-13 14:49:19,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80525426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528281318] [2024-11-13 14:49:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:19,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:19,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:19,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:19,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:49:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:19,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:49:19,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:49:19,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:49:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528281318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:49:19,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:49:19,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-13 14:49:19,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744769659] [2024-11-13 14:49:19,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:49:19,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:19,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:19,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:19,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:19,639 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:49:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:19,814 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-13 14:49:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:49:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2024-11-13 14:49:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:19,816 INFO L225 Difference]: With dead ends: 41 [2024-11-13 14:49:19,816 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 14:49:19,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:19,817 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:19,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:49:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 14:49:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-13 14:49:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:49:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-13 14:49:19,829 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-11-13 14:49:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:19,830 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-13 14:49:19,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:49:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-13 14:49:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 14:49:19,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:19,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:19,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:49:20,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:20,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:20,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash -648293832, now seen corresponding path program 2 times [2024-11-13 14:49:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:20,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185315510] [2024-11-13 14:49:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:21,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:49:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:49:21,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:21,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185315510] [2024-11-13 14:49:21,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185315510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:21,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:21,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:49:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906610237] [2024-11-13 14:49:21,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:21,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:49:21,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:21,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:49:21,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:49:21,388 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:49:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:21,590 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-11-13 14:49:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:49:21,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-13 14:49:21,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:21,592 INFO L225 Difference]: With dead ends: 27 [2024-11-13 14:49:21,592 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 14:49:21,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:49:21,593 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:21,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 103 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:49:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 14:49:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-13 14:49:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:49:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-13 14:49:21,600 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 31 [2024-11-13 14:49:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:21,601 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-13 14:49:21,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:49:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-13 14:49:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 14:49:21,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:21,602 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:21,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:49:21,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:21,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash -240081431, now seen corresponding path program 1 times [2024-11-13 14:49:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:21,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97062995] [2024-11-13 14:49:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:22,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:22,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:49:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:49:22,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:22,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97062995] [2024-11-13 14:49:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97062995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:22,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477613165] [2024-11-13 14:49:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:22,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:22,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:22,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:22,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:49:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:23,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 14:49:23,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:23,299 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 21 [2024-11-13 14:49:23,304 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 0 case distinctions, treesize of input 45 treesize of output 22 [2024-11-13 14:49:23,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:49:23,356 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 26 treesize of output 18 [2024-11-13 14:49:23,362 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 22 treesize of output 14 [2024-11-13 14:49:23,404 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 20 treesize of output 8 [2024-11-13 14:49:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:49:23,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:23,430 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 108 treesize of output 78 [2024-11-13 14:49:23,443 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 26 treesize of output 22 [2024-11-13 14:49:23,468 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 25 treesize of output 21 [2024-11-13 14:49:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 14:49:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477613165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:49:23,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:49:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 18 [2024-11-13 14:49:23,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046945942] [2024-11-13 14:49:23,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:49:23,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:49:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:23,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:49:23,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:49:23,573 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:49:27,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:31,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:35,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:39,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:44,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:44,139 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-13 14:49:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:49:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-11-13 14:49:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:44,141 INFO L225 Difference]: With dead ends: 34 [2024-11-13 14:49:44,141 INFO L226 Difference]: Without dead ends: 31 [2024-11-13 14:49:44,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2024-11-13 14:49:44,144 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:44,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 228 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-11-13 14:49:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-13 14:49:44,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-13 14:49:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:49:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-13 14:49:44,158 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 33 [2024-11-13 14:49:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:44,159 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-13 14:49:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:49:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-13 14:49:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 14:49:44,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:44,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:44,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:49:44,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:44,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:44,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:44,362 INFO L85 PathProgramCache]: Analyzing trace with hash -240079757, now seen corresponding path program 1 times [2024-11-13 14:49:44,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:44,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491986736] [2024-11-13 14:49:44,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:44,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:49:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:49:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:46,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491986736] [2024-11-13 14:49:46,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491986736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:46,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533663897] [2024-11-13 14:49:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:46,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:46,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:46,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:46,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:49:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:46,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-13 14:49:46,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:46,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:49:46,624 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-13 14:49:46,744 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-13 14:49:47,015 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 11 treesize of output 3 [2024-11-13 14:49:47,022 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 9 treesize of output 3 [2024-11-13 14:49:47,381 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 14:49:47,382 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 15 treesize of output 15 [2024-11-13 14:49:47,413 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 20 treesize of output 15 [2024-11-13 14:49:47,570 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-13 14:49:47,570 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-13 14:49:47,581 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 25 treesize of output 17 [2024-11-13 14:49:47,593 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 21 [2024-11-13 14:49:47,600 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 0 case distinctions, treesize of input 60 treesize of output 33 [2024-11-13 14:49:47,612 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 38 treesize of output 25 [2024-11-13 14:49:47,706 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 68 treesize of output 48 [2024-11-13 14:49:47,714 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 52 treesize of output 36 [2024-11-13 14:49:47,822 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 33 treesize of output 15 [2024-11-13 14:49:47,834 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-13 14:49:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:49:47,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:48,156 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 208 treesize of output 178 [2024-11-13 14:49:48,161 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 314 treesize of output 254 [2024-11-13 14:49:48,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse0 (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse2 (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse1 (and (forall ((v_ArrVal_583 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_583) v_arrayElimCell_22) v_arrayElimCell_23))) (forall ((v_ArrVal_583 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse8 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_583) v_arrayElimCell_22))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 v_arrayElimCell_23)))))))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_583 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_583) .cse2) .cse3))) (forall ((v_ArrVal_584 Int)) (not (= v_ArrVal_584 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_584)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not .cse0)) (forall ((v_ArrVal_583 (Array Int Int))) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_583))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 .cse2) .cse3)) (forall ((v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 v_arrayElimCell_22) v_arrayElimCell_23)))))) (forall ((v_ArrVal_583 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_583))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 .cse2) .cse3)) (forall ((v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse7 (select .cse6 v_arrayElimCell_22))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_arrayElimCell_23)))))))) (or .cse1 (forall ((v_ArrVal_584 Int)) (= v_ArrVal_584 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.offset| v_ArrVal_584)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2024-11-13 14:49:49,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533663897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:49,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:49:49,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-13 14:49:49,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368945104] [2024-11-13 14:49:49,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:49:49,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 14:49:49,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 14:49:49,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=981, Unknown=1, NotChecked=62, Total=1122 [2024-11-13 14:49:49,164 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 24 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:49:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:50,850 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-13 14:49:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:49:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 24 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2024-11-13 14:49:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:50,851 INFO L225 Difference]: With dead ends: 36 [2024-11-13 14:49:50,851 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 14:49:50,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=154, Invalid=1919, Unknown=1, NotChecked=88, Total=2162 [2024-11-13 14:49:50,853 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:50,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 241 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:49:50,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 14:49:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-13 14:49:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:49:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-13 14:49:50,861 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 33 [2024-11-13 14:49:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:50,861 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-13 14:49:50,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 24 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:49:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-13 14:49:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:49:50,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:50,863 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:50,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:49:51,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:51,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:51,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1211620708, now seen corresponding path program 1 times [2024-11-13 14:49:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092135384] [2024-11-13 14:49:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:49:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:49:52,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:52,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092135384] [2024-11-13 14:49:52,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092135384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:52,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738509951] [2024-11-13 14:49:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:52,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:52,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:52,498 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:52,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:49:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-13 14:49:52,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:52,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:49:52,758 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-13 14:49:52,826 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 12 treesize of output 4 [2024-11-13 14:49:52,833 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 9 treesize of output 3 [2024-11-13 14:49:53,095 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 14:49:53,095 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 21 treesize of output 24 [2024-11-13 14:49:53,127 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 14:49:53,128 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 15 treesize of output 15 [2024-11-13 14:49:53,226 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 25 treesize of output 17 [2024-11-13 14:49:53,235 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 42 treesize of output 37 [2024-11-13 14:49:53,241 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 0 case distinctions, treesize of input 61 treesize of output 34 [2024-11-13 14:49:53,278 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-13 14:49:53,278 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-13 14:49:53,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 49 [2024-11-13 14:49:53,349 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 53 treesize of output 37 [2024-11-13 14:49:53,438 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 9 treesize of output 3 [2024-11-13 14:49:53,573 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 14:49:53,574 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2024-11-13 14:49:53,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 14:49:53,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:53,780 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 236 treesize of output 206 [2024-11-13 14:49:54,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:49:54,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 311 [2024-11-13 14:49:54,416 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-13 14:49:54,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-11-13 14:49:54,459 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-13 14:49:54,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-11-13 14:49:54,793 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-13 14:49:54,793 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 35 treesize of output 8 [2024-11-13 14:49:55,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738509951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:55,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:49:55,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2024-11-13 14:49:55,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587634556] [2024-11-13 14:49:55,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:49:55,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 14:49:55,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:55,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 14:49:55,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:49:55,411 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 22 states have internal predecessors, (39), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:49:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:56,895 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-13 14:49:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 14:49:56,896 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 22 states have internal predecessors, (39), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2024-11-13 14:49:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:56,898 INFO L225 Difference]: With dead ends: 37 [2024-11-13 14:49:56,898 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 14:49:56,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2024-11-13 14:49:56,903 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:56,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 304 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:49:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 14:49:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-13 14:49:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:49:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-13 14:49:56,912 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 35 [2024-11-13 14:49:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:56,912 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-13 14:49:56,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 22 states have internal predecessors, (39), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:49:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-13 14:49:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:49:56,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:56,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:56,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:49:57,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 14:49:57,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:57,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1211622382, now seen corresponding path program 1 times [2024-11-13 14:49:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:57,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757607354] [2024-11-13 14:49:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:49:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:49:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:50:00,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:50:00,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757607354] [2024-11-13 14:50:00,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757607354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:00,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232108439] [2024-11-13 14:50:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:00,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:50:00,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:50:00,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:50:00,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:50:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:00,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-11-13 14:50:00,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:00,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:50:00,433 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-13 14:50:00,529 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-13 14:50:04,854 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-13 14:50:04,858 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-13 14:50:04,905 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 14:50:04,906 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 20 treesize of output 23 [2024-11-13 14:50:04,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:50:04,950 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-13 14:50:04,958 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))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-13 14:50:04,961 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-13 14:50:05,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)))) is different from false [2024-11-13 14:50:05,043 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)))) is different from true [2024-11-13 14:50:05,102 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0)))))) is different from false [2024-11-13 14:50:05,106 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0)))))) is different from true [2024-11-13 14:50:05,126 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 45 treesize of output 21 [2024-11-13 14:50:05,135 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 15 treesize of output 11 [2024-11-13 14:50:05,146 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 11 treesize of output 3 [2024-11-13 14:50:05,188 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimCell_44 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-13 14:50:05,191 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimCell_44 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-13 14:50:05,230 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-13 14:50:05,234 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-13 14:50:05,323 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_#res#1.offset| 4))) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base|) .cse0 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base|) .cse0 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|))) |c_#memory_$Pointer$#1.offset|))) is different from false [2024-11-13 14:50:05,327 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_node_create_#res#1.offset| 4))) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base|) .cse0 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base|) .cse0 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|))) |c_#memory_$Pointer$#1.offset|))) is different from true [2024-11-13 14:50:05,439 INFO L349 Elim1Store]: treesize reduction 75, result has 23.5 percent of original size [2024-11-13 14:50:05,440 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 32 treesize of output 36 [2024-11-13 14:50:05,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:50:05,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-11-13 14:50:05,559 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-13 14:50:05,559 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 40 treesize of output 47 [2024-11-13 14:50:05,605 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse3) 0) (or (and (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse3) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= .cse1 .cse0))))) is different from false [2024-11-13 14:50:05,609 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse3) 0) (or (and (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse3) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= .cse1 .cse0))))) is different from true [2024-11-13 14:50:05,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:50:05,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 63 [2024-11-13 14:50:05,938 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-13 14:50:05,938 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 127 [2024-11-13 14:50:05,986 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-13 14:50:05,987 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-13 14:50:06,316 INFO L349 Elim1Store]: treesize reduction 57, result has 46.2 percent of original size [2024-11-13 14:50:06,317 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 103 treesize of output 116 [2024-11-13 14:50:06,403 INFO L349 Elim1Store]: treesize reduction 117, result has 15.2 percent of original size [2024-11-13 14:50:06,403 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 69 [2024-11-13 14:50:06,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse1 (+ .cse5 4))) (let ((.cse2 (select .cse6 .cse1))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (and (= .cse5 4) (= (select .cse6 8) .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)) (let ((.cse9 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse12 (select |v_#valid_BEFORE_CALL_7| .cse12)))))))) (or (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse7) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))))))))) .cse9 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse10) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))))))))) (and (or (= .cse5 0) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) .cse2)))) .cse9))) (or (= .cse3 .cse2) (= .cse0 .cse3) (= 1 (select (select |c_#memory_int#1| .cse3) 0)))))))) is different from false [2024-11-13 14:50:06,589 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse1 (+ .cse5 4))) (let ((.cse2 (select .cse6 .cse1))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (and (= .cse5 4) (= (select .cse6 8) .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)) (let ((.cse9 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse12 (select |v_#valid_BEFORE_CALL_7| .cse12)))))))) (or (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse7) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))))))))) .cse9 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse10) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))))))))) (and (or (= .cse5 0) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) .cse2)))) .cse9))) (or (= .cse3 .cse2) (= .cse0 .cse3) (= 1 (select (select |c_#memory_int#1| .cse3) 0)))))))) is different from true [2024-11-13 14:50:06,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:50:06,807 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 470 treesize of output 446 [2024-11-13 14:50:06,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:50:06,965 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 373 treesize of output 365 [2024-11-13 14:51:06,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse1 (select .cse4 .cse0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= .cse1 .cse3) (= (select (select |c_#memory_int#1| .cse3) 0) 1)) (or (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 4) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 8))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)))))) is different from false [2024-11-13 14:51:06,765 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse1 (select .cse4 .cse0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= .cse1 .cse3) (= (select (select |c_#memory_int#1| .cse3) 0) 1)) (or (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 4) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse4 8))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0)))))) is different from true [2024-11-13 14:51:06,929 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_22| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_22| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-13 14:51:06,932 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_22| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_22| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-13 14:51:06,950 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 14:51:06,951 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 40 [2024-11-13 14:51:06,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:51:06,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-11-13 14:51:06,980 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_2) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (not (= v_arrayElimIndex_2 0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-13 14:51:06,983 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_2) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (not (= v_arrayElimIndex_2 0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-13 14:51:07,009 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_2) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (not (= v_arrayElimIndex_2 0))))) is different from false [2024-11-13 14:51:07,011 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_2) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (not (= v_arrayElimIndex_2 0))))) is different from true [2024-11-13 14:51:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-13 14:51:07,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232108439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:08,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:51:08,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2024-11-13 14:51:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954717081] [2024-11-13 14:51:08,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:51:08,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 14:51:08,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:51:08,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 14:51:08,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1045, Unknown=26, NotChecked=988, Total=2162 [2024-11-13 14:51:08,054 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 41 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 32 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:51:08,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse3 1))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse1 (select |c_#memory_int#1| .cse1))))))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from false [2024-11-13 14:51:08,528 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse3 1))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse1 (select |c_#memory_int#1| .cse1))))))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from true [2024-11-13 14:51:08,532 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))) (let ((.cse2 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse2 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2)))) is different from false [2024-11-13 14:51:08,534 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse2 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2)))) is different from true [2024-11-13 14:51:08,538 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))) (let ((.cse2 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse2 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2)))) is different from false [2024-11-13 14:51:08,540 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse2 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2)))) is different from true [2024-11-13 14:51:08,544 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 1 (select |c_#valid| .cse0)) (or (= .cse2 1) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|))))) is different from false [2024-11-13 14:51:08,546 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 1 (select |c_#valid| .cse0)) (or (= .cse2 1) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|))))) is different from true [2024-11-13 14:51:08,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0)))))) is different from false [2024-11-13 14:51:08,553 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0)))))) is different from true [2024-11-13 14:51:08,557 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimCell_44 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2024-11-13 14:51:08,559 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int) (v_arrayElimCell_44 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2024-11-13 14:51:08,565 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-13 14:51:08,568 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-13 14:51:08,586 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse3 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse1 (+ |c_node_create_#res#1.offset| 4)) (.cse6 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base|) .cse1 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse2)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse3 (select |c_#memory_int#1| .cse3))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse3 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse6)) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base|) .cse1 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|))) |c_#memory_$Pointer$#1.offset|) (= |c_#valid| (let ((.cse7 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse7 (select |c_#valid| .cse7)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (= |c_node_create_#in~data#1| (select .cse2 0)))) is different from false [2024-11-13 14:51:08,594 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse3 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse1 (+ |c_node_create_#res#1.offset| 4)) (.cse6 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base|) .cse1 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse2)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse3 (select |c_#memory_int#1| .cse3))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse3 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse6)) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base|) .cse1 0) |c_node_create_#res#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|))) |c_#memory_$Pointer$#1.offset|) (= |c_#valid| (let ((.cse7 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse7 (select |c_#valid| .cse7)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (= |c_node_create_#in~data#1| (select .cse2 0)))) is different from true [2024-11-13 14:51:08,604 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse4 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (not (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse4) 0) (or (and (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= .cse1 .cse0))))) is different from false [2024-11-13 14:51:08,608 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse4 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (not (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse4) 0) (or (and (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= .cse1 .cse0))))) is different from true [2024-11-13 14:51:08,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse3 (+ .cse8 4))) (let ((.cse4 (select .cse9 .cse3))) (let ((.cse1 (select .cse9 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| .cse7)) (.cse0 (= .cse8 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) 0)) (= (select .cse2 .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse4) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse7) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 4) 0) (or (and (= .cse8 4) (= (select .cse9 8) .cse7)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0)) (let ((.cse12 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse15 (select |v_#valid_BEFORE_CALL_7| .cse15)))))))) (or (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse10) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))))))))) .cse12 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse13) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse14 (select |v_#valid_BEFORE_CALL_7| .cse14))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) .cse4)))) .cse12))) (or (= .cse5 .cse4) (= .cse7 .cse5) (= 1 (select (select |c_#memory_int#1| .cse5) 0)))))))) is different from false [2024-11-13 14:51:08,706 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse3 (+ .cse8 4))) (let ((.cse4 (select .cse9 .cse3))) (let ((.cse1 (select .cse9 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| .cse7)) (.cse0 (= .cse8 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) 0)) (= (select .cse2 .cse3) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse4) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse7) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 4) 0) (or (and (= .cse8 4) (= (select .cse9 8) .cse7)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0)) (let ((.cse12 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse15 (select |v_#valid_BEFORE_CALL_7| .cse15)))))))) (or (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse10) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))))))))) .cse12 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_44) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse13) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse14 (select |v_#valid_BEFORE_CALL_7| .cse14))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_5|) .cse4)))) .cse12))) (or (= .cse5 .cse4) (= .cse7 .cse5) (= 1 (select (select |c_#memory_int#1| .cse5) 0)))))))) is different from true [2024-11-13 14:51:08,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse2 (select .cse6 .cse1))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse5 (select .cse6 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 .cse1) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1))) (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 0)) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= .cse2 .cse4) (= (select (select |c_#memory_int#1| .cse4) 0) 1)) (or (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 4) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse6 8))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)))))) is different from false [2024-11-13 14:51:08,715 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse2 (select .cse6 .cse1))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse5 (select .cse6 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 .cse1) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1))) (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 0)) (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= .cse2 .cse4) (= (select (select |c_#memory_int#1| .cse4) 0) 1)) (or (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 4) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse6 8))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)))))) is different from true [2024-11-13 14:51:08,720 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_22| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_22| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) 0))) is different from false [2024-11-13 14:51:08,723 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_22| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_22| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) 0))) is different from true [2024-11-13 14:51:08,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_2) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (not (= v_arrayElimIndex_2 0)))) (= .cse1 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2024-11-13 14:51:08,731 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_2) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (not (= v_arrayElimIndex_2 0)))) (= .cse1 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2024-11-13 14:51:08,736 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_2) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (not (= v_arrayElimIndex_2 0)))))) is different from false [2024-11-13 14:51:08,739 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_2) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (not (= v_arrayElimIndex_2 0)))))) is different from true [2024-11-13 14:51:08,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse3 1))) (and (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse1 (select |c_#memory_int#1| .cse1))))))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from false [2024-11-13 14:51:08,818 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse3 1))) (and (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse1 (select |c_#memory_int#1| .cse1))))))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from true [2024-11-13 14:51:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:08,942 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-11-13 14:51:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 14:51:08,942 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 32 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2024-11-13 14:51:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:08,945 INFO L225 Difference]: With dead ends: 56 [2024-11-13 14:51:08,945 INFO L226 Difference]: Without dead ends: 54 [2024-11-13 14:51:08,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=155, Invalid=1307, Unknown=56, NotChecked=2772, Total=4290 [2024-11-13 14:51:08,946 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1192 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:08,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 0 Unknown, 1192 Unchecked, 0.4s Time] [2024-11-13 14:51:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-13 14:51:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-13 14:51:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:51:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-11-13 14:51:08,966 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 35 [2024-11-13 14:51:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:08,967 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-11-13 14:51:08,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 32 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:51:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-11-13 14:51:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:51:08,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:08,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:08,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:51:09,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 14:51:09,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:09,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash 433005087, now seen corresponding path program 2 times [2024-11-13 14:51:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:51:09,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982251276] [2024-11-13 14:51:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:09,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:51:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:51:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:09,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:51:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:09,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:51:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 14:51:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:51:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982251276] [2024-11-13 14:51:09,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982251276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575662982] [2024-11-13 14:51:09,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:51:09,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:09,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:09,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:09,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:51:09,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:51:09,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:51:09,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 14:51:09,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 14:51:09,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 14:51:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575662982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:51:09,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:51:09,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-13 14:51:09,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246267278] [2024-11-13 14:51:09,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:51:09,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:51:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:51:09,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:51:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:51:09,694 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:51:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:09,776 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-13 14:51:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:51:09,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-13 14:51:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:09,778 INFO L225 Difference]: With dead ends: 66 [2024-11-13 14:51:09,778 INFO L226 Difference]: Without dead ends: 63 [2024-11-13 14:51:09,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:51:09,779 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:09,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 136 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:51:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-13 14:51:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-11-13 14:51:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:51:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2024-11-13 14:51:09,798 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 37 [2024-11-13 14:51:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:09,798 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-11-13 14:51:09,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:51:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2024-11-13 14:51:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:51:09,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:09,799 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:09,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:51:10,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:10,000 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:10,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash 433006761, now seen corresponding path program 2 times [2024-11-13 14:51:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:51:10,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803865058] [2024-11-13 14:51:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:51:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:51:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:51:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:12,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:51:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:51:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:51:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803865058] [2024-11-13 14:51:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803865058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104535984] [2024-11-13 14:51:12,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:51:12,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:12,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:12,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:51:12,663 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:51:12,664 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:51:12,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-13 14:51:12,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:12,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:51:12,794 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-13 14:51:12,801 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-13 14:51:13,075 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 14:51:13,076 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 16 treesize of output 15 [2024-11-13 14:51:13,100 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 14:51:13,101 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 16 treesize of output 15 [2024-11-13 14:51:13,135 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 14:51:13,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 14:51:13,231 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-13 14:51:13,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 14:51:13,540 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 14:51:13,540 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-13 14:51:13,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 14:51:13,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-13 14:51:13,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:51:13,853 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 14:51:13,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-13 14:51:13,877 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-13 14:51:13,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-13 14:51:13,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-13 14:51:14,021 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 14:51:14,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2024-11-13 14:51:14,028 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 0 case distinctions, treesize of input 116 treesize of output 69 [2024-11-13 14:51:14,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 14:51:14,078 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 14:51:14,079 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:51:14,200 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 116 treesize of output 80 [2024-11-13 14:51:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:51:14,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:15,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:51:15,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 423 treesize of output 385 [2024-11-13 14:51:15,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:51:15,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 336 [2024-11-13 14:51:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104535984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:15,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:51:15,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2024-11-13 14:51:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746442354] [2024-11-13 14:51:15,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:51:15,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-13 14:51:15,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:51:15,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-13 14:51:15,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2416, Unknown=0, NotChecked=0, Total=2550 [2024-11-13 14:51:15,627 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 44 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 35 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:51:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:17,743 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-11-13 14:51:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 14:51:17,743 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 35 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-13 14:51:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:17,744 INFO L225 Difference]: With dead ends: 77 [2024-11-13 14:51:17,744 INFO L226 Difference]: Without dead ends: 56 [2024-11-13 14:51:17,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=226, Invalid=3934, Unknown=0, NotChecked=0, Total=4160 [2024-11-13 14:51:17,746 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:17,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 380 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:51:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-13 14:51:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-13 14:51:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:51:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-11-13 14:51:17,760 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 37 [2024-11-13 14:51:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:17,760 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-13 14:51:17,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 35 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:51:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-13 14:51:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 14:51:17,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:17,761 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:17,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 14:51:17,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:17,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:17,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash 901236737, now seen corresponding path program 3 times [2024-11-13 14:51:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:51:17,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488291851] [2024-11-13 14:51:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:17,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:51:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:51:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:51:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:18,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 14:51:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:51:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 14:51:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:51:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488291851] [2024-11-13 14:51:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488291851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955506521] [2024-11-13 14:51:18,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:51:18,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:18,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:18,106 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:18,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:51:19,019 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 14:51:19,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:51:19,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:51:19,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:51:19,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955506521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:19,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:51:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-13 14:51:19,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001699385] [2024-11-13 14:51:19,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:19,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:51:19,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:51:19,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:51:19,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:51:19,045 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:51:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:19,070 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-13 14:51:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:51:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-11-13 14:51:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:19,072 INFO L225 Difference]: With dead ends: 61 [2024-11-13 14:51:19,072 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 14:51:19,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:51:19,073 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:19,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:51:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 14:51:19,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 14:51:19,074 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-13 14:51:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 14:51:19,074 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-11-13 14:51:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:19,074 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 14:51:19,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:51:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 14:51:19,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 14:51:19,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:51:19,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 14:51:19,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 14:51:19,281 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2024-11-13 14:51:19,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 14:51:22,152 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:51:22,162 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:280) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:355) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:402) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:109) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContext(BacktranslationService.java:111) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-13 14:51:22,166 INFO L158 Benchmark]: Toolchain (without parser) took 125746.02ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 99.9MB in the beginning and 333.1MB in the end (delta: -233.2MB). Peak memory consumption was 227.8MB. Max. memory is 16.1GB. [2024-11-13 14:51:22,166 INFO L158 Benchmark]: CDTParser took 1.92ms. Allocated memory is still 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:51:22,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.84ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 82.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:51:22,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.24ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:51:22,167 INFO L158 Benchmark]: Boogie Preprocessor took 85.83ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 78.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:51:22,167 INFO L158 Benchmark]: RCFGBuilder took 617.17ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 62.8MB in the end (delta: 15.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:51:22,167 INFO L158 Benchmark]: TraceAbstraction took 124240.44ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 62.2MB in the beginning and 333.1MB in the end (delta: -270.9MB). Peak memory consumption was 202.6MB. Max. memory is 16.1GB. [2024-11-13 14:51:22,169 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.92ms. Allocated memory is still 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.84ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 82.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.24ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 85.83ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 78.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 617.17ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 62.8MB in the end (delta: 15.3MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 124240.44ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 62.2MB in the beginning and 333.1MB in the end (delta: -270.9MB). Peak memory consumption was 202.6MB. 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: 629]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 121.3s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 23.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 1864 SdHoareTripleChecker+Invalid, 23.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1192 IncrementalHoareTripleChecker+Unchecked, 1677 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2640 IncrementalHoareTripleChecker+Invalid, 3858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 187 mSDtfsCounter, 2640 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 354 SyntacticMatches, 7 SemanticMatches, 267 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 88.9s InterpolantComputationTime, 602 NumberOfCodeBlocks, 602 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 674 ConstructedInterpolants, 44 QuantifiedInterpolants, 8231 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 492 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 296/444 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 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-13 14:51:22,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:51:24,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:51:24,809 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:51:24,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:51:24,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:51:24,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:51:24,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:51:24,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:51:24,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:51:24,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:51:24,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:51:24,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:51:24,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:51:24,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:51:24,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:51:24,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:51:24,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:51:24,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:51:24,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:51:24,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:51:24,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:51:24,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:51:24,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:51:24,875 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:51:24,875 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:51:24,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:51:24,878 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:51:24,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:51:24,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:51:24,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:51:24,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:51:24,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:51:24,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:51:24,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:51:24,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:51:24,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:51:24,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:51:24,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:51:24,880 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:51:24,880 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:51:24,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:51:24,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:51:24,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:51:24,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:51:24,881 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-11-13 14:51:25,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:51:25,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:51:25,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:51:25,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:51:25,168 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:51:25,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i Unable to find full path for "g++" [2024-11-13 14:51:27,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:51:27,550 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:51:27,551 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-13 14:51:27,573 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/data/cc52dacf2/e6ede426fbbf490c9ba611da61c29683/FLAG9e3e0c592 [2024-11-13 14:51:27,597 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/data/cc52dacf2/e6ede426fbbf490c9ba611da61c29683 [2024-11-13 14:51:27,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:51:27,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:51:27,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:51:27,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:51:27,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:51:27,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:51:27" (1/1) ... [2024-11-13 14:51:27,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5436ced0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:27, skipping insertion in model container [2024-11-13 14:51:27,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:51:27" (1/1) ... [2024-11-13 14:51:27,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:51:28,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-13 14:51:28,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:51:28,056 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:51:28,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2024-11-13 14:51:28,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:51:28,133 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:51:28,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28 WrapperNode [2024-11-13 14:51:28,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:51:28,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:51:28,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:51:28,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:51:28,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,183 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 112 [2024-11-13 14:51:28,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:51:28,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:51:28,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:51:28,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:51:28,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,217 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-13 14:51:28,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:51:28,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:51:28,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:51:28,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:51:28,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (1/1) ... [2024-11-13 14:51:28,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:51:28,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:28,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:51:28,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:51:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:51:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:51:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 14:51:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 14:51:28,334 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 14:51:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:51:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:51:28,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:51:28,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:51:28,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:51:28,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:51:28,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:51:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:51:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:51:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:51:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:51:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:51:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 14:51:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:51:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:51:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 14:51:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:51:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:51:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:51:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:51:28,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:51:28,542 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:51:28,546 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:51:28,881 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-13 14:51:28,881 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:51:28,890 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:51:28,891 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 14:51:28,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:51:28 BoogieIcfgContainer [2024-11-13 14:51:28,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:51:28,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:51:28,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:51:28,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:51:28,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:51:27" (1/3) ... [2024-11-13 14:51:28,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e6c65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:51:28, skipping insertion in model container [2024-11-13 14:51:28,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:51:28" (2/3) ... [2024-11-13 14:51:28,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e6c65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:51:28, skipping insertion in model container [2024-11-13 14:51:28,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:51:28" (3/3) ... [2024-11-13 14:51:28,901 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-11-13 14:51:28,916 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:51:28,918 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_unequal.i that has 2 procedures, 27 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-13 14:51:28,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:51:28,984 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=LoopHeads, 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;@70c5e7d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:51:28,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:51:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:51:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 14:51:28,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:28,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:28,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:29,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash -699840632, now seen corresponding path program 1 times [2024-11-13 14:51:29,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708176470] [2024-11-13 14:51:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:29,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:29,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:29,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:29,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:51:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:29,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:51:29,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:51:29,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:29,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:29,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708176470] [2024-11-13 14:51:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708176470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:29,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:29,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:51:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968071468] [2024-11-13 14:51:29,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:29,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:51:29,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:51:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:51:29,365 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:51:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:29,412 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-13 14:51:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:51:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-13 14:51:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:29,422 INFO L225 Difference]: With dead ends: 52 [2024-11-13 14:51:29,422 INFO L226 Difference]: Without dead ends: 24 [2024-11-13 14:51:29,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:51:29,429 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:29,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:51:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-13 14:51:29,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-13 14:51:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:51:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-13 14:51:29,474 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-11-13 14:51:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:29,475 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-13 14:51:29,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:51:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-13 14:51:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 14:51:29,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:29,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:29,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 14:51:29,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:29,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:29,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash 380631264, now seen corresponding path program 1 times [2024-11-13 14:51:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132400900] [2024-11-13 14:51:29,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:29,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:29,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:29,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:29,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:51:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:29,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:51:29,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:51:29,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:51:30,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:30,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132400900] [2024-11-13 14:51:30,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132400900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:51:30,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:51:30,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-13 14:51:30,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884388263] [2024-11-13 14:51:30,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:51:30,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:51:30,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:30,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:51:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:51:30,058 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:51:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:30,206 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-11-13 14:51:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:51:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2024-11-13 14:51:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:30,208 INFO L225 Difference]: With dead ends: 47 [2024-11-13 14:51:30,209 INFO L226 Difference]: Without dead ends: 31 [2024-11-13 14:51:30,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:51:30,211 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:30,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 64 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:51:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-13 14:51:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-13 14:51:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:51:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-13 14:51:30,223 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 23 [2024-11-13 14:51:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:30,223 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-13 14:51:30,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:51:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-13 14:51:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 14:51:30,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:30,226 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:30,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:51:30,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:30,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:30,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:30,430 INFO L85 PathProgramCache]: Analyzing trace with hash -648293832, now seen corresponding path program 2 times [2024-11-13 14:51:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:30,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468829876] [2024-11-13 14:51:30,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:51:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:30,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:30,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:30,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:51:30,602 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:51:30,602 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:51:30,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 14:51:30,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:30,738 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-13 14:51:30,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:51:30,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:51:30,841 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 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-13 14:51:30,892 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 23 [2024-11-13 14:51:30,900 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 23 treesize of output 15 [2024-11-13 14:51:30,907 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 15 treesize of output 7 [2024-11-13 14:51:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:51:30,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:30,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:30,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468829876] [2024-11-13 14:51:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468829876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:30,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:30,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:51:30,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088820605] [2024-11-13 14:51:30,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:30,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:51:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:30,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:51:30,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:51:30,933 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:51:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:31,493 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-13 14:51:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:51:31,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-13 14:51:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:31,496 INFO L225 Difference]: With dead ends: 33 [2024-11-13 14:51:31,497 INFO L226 Difference]: Without dead ends: 31 [2024-11-13 14:51:31,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:51:31,498 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:31,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:51:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-13 14:51:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-13 14:51:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:51:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-13 14:51:31,509 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 31 [2024-11-13 14:51:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:31,509 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-13 14:51:31,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:51:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-13 14:51:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 14:51:31,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:31,511 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:31,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:51:31,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:31,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:31,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash -240081431, now seen corresponding path program 1 times [2024-11-13 14:51:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:31,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163577000] [2024-11-13 14:51:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:31,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:31,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:31,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:51:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:31,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 14:51:31,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:32,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 14:51:32,383 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-13 14:51:32,384 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 47 [2024-11-13 14:51:32,488 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-13 14:51:32,552 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 20 treesize of output 12 [2024-11-13 14:51:32,607 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 16 treesize of output 8 [2024-11-13 14:51:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:51:32,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:32,755 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 108 treesize of output 78 [2024-11-13 14:51:32,763 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 26 treesize of output 22 [2024-11-13 14:51:32,794 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 25 treesize of output 21 [2024-11-13 14:51:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 14:51:32,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:32,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163577000] [2024-11-13 14:51:32,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163577000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:51:32,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:51:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 17 [2024-11-13 14:51:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225304608] [2024-11-13 14:51:32,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:51:32,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:51:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:51:32,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:51:32,967 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:51:37,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:51:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:38,262 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-13 14:51:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:51:38,263 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-13 14:51:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:38,264 INFO L225 Difference]: With dead ends: 40 [2024-11-13 14:51:38,264 INFO L226 Difference]: Without dead ends: 37 [2024-11-13 14:51:38,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:51:38,265 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:38,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 193 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2024-11-13 14:51:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-13 14:51:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-13 14:51:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:51:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-13 14:51:38,276 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 33 [2024-11-13 14:51:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:38,277 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-13 14:51:38,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:51:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-13 14:51:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 14:51:38,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:38,278 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:38,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:51:38,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:38,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash -240079757, now seen corresponding path program 1 times [2024-11-13 14:51:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:38,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329261736] [2024-11-13 14:51:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:38,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:38,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:38,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:38,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:51:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:38,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 14:51:38,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:38,721 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 7 [2024-11-13 14:51:38,786 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-13 14:51:38,934 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-13 14:51:39,179 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 5 [2024-11-13 14:51:39,572 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 14:51:39,573 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 20 treesize of output 23 [2024-11-13 14:51:39,584 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 5 treesize of output 3 [2024-11-13 14:51:39,629 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 14:51:39,630 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 17 treesize of output 17 [2024-11-13 14:51:39,816 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 23 treesize of output 15 [2024-11-13 14:51:39,823 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 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-13 14:51:39,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-13 14:51:39,882 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 14:51:39,884 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:51:39,910 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 11 [2024-11-13 14:51:40,044 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 50 treesize of output 30 [2024-11-13 14:51:40,182 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 27 treesize of output 15 [2024-11-13 14:51:40,192 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 7 treesize of output 3 [2024-11-13 14:51:40,286 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 15 treesize of output 7 [2024-11-13 14:51:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:51:40,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:40,621 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 208 treesize of output 178 [2024-11-13 14:51:40,632 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 314 treesize of output 254 [2024-11-13 14:51:41,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse3 (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse6 (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_arrayElimCell_26) v_arrayElimCell_27)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 .cse5) .cse3)))))) (.cse0 (and (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_272) v_arrayElimCell_26))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_27)) (= (select .cse10 .cse3) |c_ULTIMATE.start_main_~data~0#1|)))) (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_272) v_arrayElimCell_26) v_arrayElimCell_27))))) (.cse1 (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (.cse7 (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 .cse1) (forall ((v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_272))) (or (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32))) (let ((.cse2 (select .cse4 v_arrayElimCell_26))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 v_arrayElimCell_27)) (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse4 .cse5) .cse3))))) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) .cse6) (or .cse6 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or .cse7 .cse0) (or (forall ((v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_272) .cse5) .cse3))) (not .cse1) (not .cse7)))))) is different from false [2024-11-13 14:51:41,505 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse4 (select .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_272) v_arrayElimCell_26) v_arrayElimCell_27))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (forall ((v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_272))) (or (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32))) (let ((.cse1 (select .cse3 v_arrayElimCell_26))) (or (= (select .cse1 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_arrayElimCell_27))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 .cse4) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (or (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_272) v_arrayElimCell_26) v_arrayElimCell_27))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_272) v_arrayElimCell_26))) (or (= (select .cse5 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 v_arrayElimCell_27)))))))) .cse6) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 v_arrayElimCell_26) v_arrayElimCell_27)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 .cse4) .cse2))))))) (or (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_arrayElimCell_26) v_arrayElimCell_27)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse4) .cse2)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|)))))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))) (forall ((v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_272) v_arrayElimCell_26))) (or (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 v_arrayElimCell_27))))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_272) .cse4) .cse2)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (not .cse6))))) is different from false [2024-11-13 14:51:41,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:41,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329261736] [2024-11-13 14:51:41,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329261736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:41,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1195323337] [2024-11-13 14:51:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:41,549 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 14:51:41,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 14:51:41,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 14:51:41,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-13 14:51:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:41,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 14:51:41,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:42,045 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 7 [2024-11-13 14:51:42,088 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-13 14:51:42,253 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-13 14:51:42,695 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 11 treesize of output 3 [2024-11-13 14:51:42,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-13 14:51:47,189 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 14:51:47,190 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 20 treesize of output 23 [2024-11-13 14:51:47,251 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 14:51:47,251 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 17 treesize of output 17 [2024-11-13 14:51:47,472 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 23 treesize of output 15 [2024-11-13 14:51:47,479 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 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-13 14:51:47,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-13 14:51:47,527 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 14:51:47,528 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:51:47,546 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 11 [2024-11-13 14:51:47,721 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 50 treesize of output 30 [2024-11-13 14:51:47,868 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 27 treesize of output 15 [2024-11-13 14:51:47,876 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 7 treesize of output 3 [2024-11-13 14:51:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:51:48,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:48,075 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 208 treesize of output 178 [2024-11-13 14:51:48,081 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 314 treesize of output 254 [2024-11-13 14:51:48,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse4 (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse1 (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (.cse2 (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_352))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 .cse3) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 v_arrayElimCell_41) v_arrayElimCell_42)))))) (.cse5 (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse0 (and (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse8 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_352) v_arrayElimCell_41))) (or (= (select .cse8 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 v_arrayElimCell_42))))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_352) v_arrayElimCell_41) v_arrayElimCell_42)))))) (and (or .cse0 .cse1) (or .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (or (forall ((v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_352) .cse3) .cse4))) (not .cse1) (not .cse5)) (forall ((v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_352))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 .cse3) .cse4)) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse7 (select .cse6 v_arrayElimCell_41))) (or (= (select .cse7 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_arrayElimCell_42)))))))) (or .cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or .cse5 .cse0))))) is different from false [2024-11-13 14:51:48,820 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse4 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse3 (select .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse1 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_352) v_arrayElimCell_41))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse2)) (= (select .cse1 v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_352) .cse3) .cse2)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)))) (not .cse4)) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_352))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 .cse3) .cse2)) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse6 (select .cse5 v_arrayElimCell_41))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse2)) (= (select .cse6 v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))))))))) (or (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse7 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_352) v_arrayElimCell_41))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse2)) (= (select .cse7 v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_352) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))))) .cse4) (or (forall ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_352))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse3) .cse2)) (= (select (select .cse8 v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_352) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23| v_ArrVal_352))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 .cse3) .cse2)) (= (select (select .cse9 v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_23|)))))) is different from false [2024-11-13 14:51:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1195323337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:48,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:51:48,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-13 14:51:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753192862] [2024-11-13 14:51:48,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:51:48,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 14:51:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:48,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 14:51:48,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=977, Unknown=5, NotChecked=260, Total=1332 [2024-11-13 14:51:48,857 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 30 states, 28 states have (on average 1.5) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:51:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:51,487 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-13 14:51:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:51:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.5) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2024-11-13 14:51:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:51,489 INFO L225 Difference]: With dead ends: 42 [2024-11-13 14:51:51,489 INFO L226 Difference]: Without dead ends: 40 [2024-11-13 14:51:51,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=141, Invalid=1510, Unknown=5, NotChecked=324, Total=1980 [2024-11-13 14:51:51,491 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:51,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 200 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 14:51:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-13 14:51:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-13 14:51:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:51:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-13 14:51:51,501 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 33 [2024-11-13 14:51:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:51,501 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-13 14:51:51,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.5) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:51:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-13 14:51:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:51:51,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:51,502 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:51,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-13 14:51:51,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:51:51,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:51,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:51,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1211620708, now seen corresponding path program 1 times [2024-11-13 14:51:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:51,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368022233] [2024-11-13 14:51:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:51,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:51,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:51,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:51,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:51:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:52,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-13 14:51:52,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:52,131 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 7 [2024-11-13 14:51:52,269 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-13 14:51:52,477 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 12 treesize of output 4 [2024-11-13 14:51:52,484 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 5 [2024-11-13 14:51:52,795 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 14:51:52,796 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 17 treesize of output 17 [2024-11-13 14:51:52,816 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 21 treesize of output 16 [2024-11-13 14:51:52,999 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 14:51:52,999 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:51:53,015 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 36 treesize of output 31 [2024-11-13 14:51:53,022 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 0 case distinctions, treesize of input 55 treesize of output 28 [2024-11-13 14:51:53,038 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 11 [2024-11-13 14:51:53,176 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 51 treesize of output 31 [2024-11-13 14:51:53,300 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 7 treesize of output 3 [2024-11-13 14:51:53,422 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 14:51:53,423 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2024-11-13 14:51:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 14:51:53,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:53,826 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 236 treesize of output 206 [2024-11-13 14:51:54,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:51:54,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 159 [2024-11-13 14:51:55,177 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse4 (select .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (forall ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_1))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) v_arrayElimCell_56)))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|))))) (not (= (select v_arrayElimArr_1 (_ bv4 32)) .cse4)))) (or .cse5 (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_1))) (select .cse6 (select (select .cse6 .cse1) .cse2))) (bvadd (_ bv4 32) v_arrayElimCell_56)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|))) (not (= (select v_arrayElimArr_1 (_ bv4 32)) .cse4))))) (or (forall ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| (_ BitVec 32))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27|))) (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| .cse7)) (not (= (select v_arrayElimArr_1 (_ bv4 32)) .cse4)) (not (= (_ bv0 32) (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_27| v_arrayElimArr_1))) (select .cse8 (select (select .cse8 .cse7) (_ bv4 32)))) (bvadd (_ bv4 32) (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))))) (not .cse5))))) is different from false [2024-11-13 14:51:55,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368022233] [2024-11-13 14:51:55,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368022233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [585846777] [2024-11-13 14:51:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:55,207 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 14:51:55,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 14:51:55,209 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 14:51:55,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-13 14:51:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:55,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 14:51:55,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:55,787 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 7 [2024-11-13 14:51:55,947 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-13 14:51:56,334 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 5 [2024-11-13 14:51:56,340 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 12 treesize of output 4 [2024-11-13 14:52:00,809 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 14:52:00,809 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 17 treesize of output 17 [2024-11-13 14:52:00,819 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 21 treesize of output 16 [2024-11-13 14:52:01,062 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 14:52:01,062 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:52:01,079 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 36 treesize of output 31 [2024-11-13 14:52:01,086 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 0 case distinctions, treesize of input 55 treesize of output 28 [2024-11-13 14:52:01,101 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 11 [2024-11-13 14:52:01,285 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 51 treesize of output 31 [2024-11-13 14:52:01,308 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 7 treesize of output 3 [2024-11-13 14:52:01,398 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 14:52:01,399 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2024-11-13 14:52:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 14:52:01,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:52:01,430 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 236 treesize of output 206 [2024-11-13 14:52:02,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:02,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 159 [2024-11-13 14:52:02,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse4 (select .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (forall ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| v_arrayElimArr_2))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) v_arrayElimCell_56)))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|) (_ bv0 1))))) (not (= (select v_arrayElimArr_2 (_ bv4 32)) .cse4)))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| v_arrayElimArr_2))) (select .cse5 (select (select .cse5 .cse1) .cse2))) (bvadd (_ bv4 32) v_arrayElimCell_56)))) (not (= (select v_arrayElimArr_2 (_ bv4 32)) .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|) (_ bv0 1))))) .cse6) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (_ bv0 32) (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31| v_arrayElimArr_2))) (select .cse7 (select (select .cse7 .cse8) (_ bv4 32)))) (bvadd (_ bv4 32) (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (not (= (select v_arrayElimArr_2 (_ bv4 32)) .cse4)) (not (= .cse8 |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_31|) (_ bv0 1)))))) (not .cse6))))) is different from false [2024-11-13 14:52:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [585846777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:52:02,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:52:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 33 [2024-11-13 14:52:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653285654] [2024-11-13 14:52:02,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:52:02,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 14:52:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:52:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 14:52:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1234, Unknown=3, NotChecked=142, Total=1482 [2024-11-13 14:52:02,564 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 33 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:52:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:05,681 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-13 14:52:05,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 14:52:05,684 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2024-11-13 14:52:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:05,685 INFO L225 Difference]: With dead ends: 42 [2024-11-13 14:52:05,685 INFO L226 Difference]: Without dead ends: 39 [2024-11-13 14:52:05,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=171, Invalid=1996, Unknown=3, NotChecked=182, Total=2352 [2024-11-13 14:52:05,687 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:05,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 352 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 14:52:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-13 14:52:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-13 14:52:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:52:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-13 14:52:05,698 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 35 [2024-11-13 14:52:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:05,698 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-13 14:52:05,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:52:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-13 14:52:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:52:05,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:05,700 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:52:05,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-13 14:52:05,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 14:52:06,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:06,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:06,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1211622382, now seen corresponding path program 1 times [2024-11-13 14:52:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:52:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674161540] [2024-11-13 14:52:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:06,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:06,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:52:06,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:52:06,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:52:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:06,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-13 14:52:06,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:52:06,293 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 7 [2024-11-13 14:52:06,330 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-13 14:52:06,398 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-13 14:52:06,602 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 14:52:06,602 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 16 treesize of output 15 [2024-11-13 14:52:06,617 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 5 treesize of output 3 [2024-11-13 14:52:06,662 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 14:52:06,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 14:52:06,784 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-13 14:52:06,795 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-13 14:52:06,811 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 20 treesize of output 15 [2024-11-13 14:52:07,192 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 32 treesize of output 16 [2024-11-13 14:52:07,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:52:07,209 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 11 treesize of output 3 [2024-11-13 14:52:07,589 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 14:52:07,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-13 14:52:07,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:07,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2024-11-13 14:52:07,668 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 14:52:07,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 14:52:07,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-13 14:52:08,008 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 14:52:08,009 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:52:08,031 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 71 treesize of output 50 [2024-11-13 14:52:08,042 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 0 case distinctions, treesize of input 101 treesize of output 58 [2024-11-13 14:52:08,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-13 14:52:08,078 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 35 treesize of output 30 [2024-11-13 14:52:08,259 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 97 treesize of output 65 [2024-11-13 14:52:08,624 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:52:08,625 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2024-11-13 14:52:08,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 14:52:08,820 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 15 treesize of output 7 [2024-11-13 14:52:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:52:08,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:52:11,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:11,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 192 [2024-11-13 14:52:11,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:11,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 171 [2024-11-13 14:52:11,266 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_35| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_589 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_35| v_arrayElimArr_4)) (.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_35| v_arrayElimArr_3)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_35|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 .cse4) .cse5)))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_35| v_ArrVal_589) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_35|))) (not (= (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (select v_arrayElimArr_4 (_ bv4 32)))) (not (= (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (select v_arrayElimArr_3 (_ bv4 32))))))) is different from false [2024-11-13 14:52:11,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:52:11,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674161540] [2024-11-13 14:52:11,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674161540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:52:11,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1297544142] [2024-11-13 14:52:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:11,281 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 14:52:11,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 14:52:11,283 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 14:52:11,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-13 14:52:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:11,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-13 14:52:11,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:52:11,834 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 7 [2024-11-13 14:52:11,860 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-13 14:52:12,028 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-13 14:52:12,281 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 14:52:12,281 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 16 treesize of output 15 [2024-11-13 14:52:12,318 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 14:52:12,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 14:52:12,539 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-13 14:52:12,544 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-13 14:52:12,553 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 20 treesize of output 15 [2024-11-13 14:52:13,228 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 47 treesize of output 23 [2024-11-13 14:52:13,238 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 7 treesize of output 3 [2024-11-13 14:52:13,245 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 11 treesize of output 3 [2024-11-13 14:52:13,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:52:18,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:18,021 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 55 treesize of output 38 [2024-11-13 14:52:18,053 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 14:52:18,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 14:52:18,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-13 14:52:18,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 14:52:18,396 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 14:52:18,396 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:52:18,413 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 71 treesize of output 50 [2024-11-13 14:52:18,422 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 0 case distinctions, treesize of input 101 treesize of output 58 [2024-11-13 14:52:18,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-13 14:52:18,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:18,465 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 35 treesize of output 30 [2024-11-13 14:52:18,759 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 97 treesize of output 65 [2024-11-13 14:52:19,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:52:19,265 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2024-11-13 14:52:19,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 14:52:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:52:19,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:52:19,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse8 (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse8 (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (bvadd (select (select .cse3 .cse4) .cse5) (_ bv4 32)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_687) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-11-13 14:52:20,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:20,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 192 [2024-11-13 14:52:20,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:20,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 171 [2024-11-13 14:52:20,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_39| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_39| v_arrayElimArr_6)) (.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_39| v_arrayElimArr_5)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_39|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (bvadd (select (select .cse3 .cse4) .cse5) (_ bv4 32)))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_39| v_ArrVal_687) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (not (= (select v_arrayElimArr_5 (_ bv4 32)) (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_39|))) (not (= (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (select v_arrayElimArr_6 (_ bv4 32))))))) is different from false [2024-11-13 14:52:20,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1297544142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:52:20,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:52:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 41 [2024-11-13 14:52:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306084628] [2024-11-13 14:52:20,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:52:20,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 14:52:20,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:52:20,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 14:52:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2023, Unknown=20, NotChecked=276, Total=2450 [2024-11-13 14:52:20,405 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 41 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:52:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:26,411 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-13 14:52:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 14:52:26,412 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2024-11-13 14:52:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:26,412 INFO L225 Difference]: With dead ends: 44 [2024-11-13 14:52:26,412 INFO L226 Difference]: Without dead ends: 42 [2024-11-13 14:52:26,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=238, Invalid=3535, Unknown=21, NotChecked=366, Total=4160 [2024-11-13 14:52:26,414 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:26,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 332 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-13 14:52:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-13 14:52:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-13 14:52:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:52:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-13 14:52:26,428 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 35 [2024-11-13 14:52:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:26,428 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-13 14:52:26,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:52:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-13 14:52:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:52:26,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:26,429 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:52:26,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-13 14:52:26,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 14:52:26,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:26,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:26,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash 433005087, now seen corresponding path program 2 times [2024-11-13 14:52:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:52:26,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059089394] [2024-11-13 14:52:26,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:52:26,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:26,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:52:26,834 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:52:26,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:52:27,093 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:52:27,093 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:52:27,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:52:27,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:52:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 14:52:27,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:52:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 14:52:27,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:52:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059089394] [2024-11-13 14:52:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059089394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:52:27,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:52:27,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-13 14:52:27,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857640746] [2024-11-13 14:52:27,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:52:27,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:52:27,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:52:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:52:27,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:52:27,359 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:52:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:27,488 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-13 14:52:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:52:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-13 14:52:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:27,490 INFO L225 Difference]: With dead ends: 49 [2024-11-13 14:52:27,490 INFO L226 Difference]: Without dead ends: 46 [2024-11-13 14:52:27,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:52:27,490 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:27,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:52:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-13 14:52:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-11-13 14:52:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:52:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-13 14:52:27,504 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 37 [2024-11-13 14:52:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:27,504 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-13 14:52:27,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:52:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-13 14:52:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:52:27,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:27,505 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:52:27,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:52:27,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:27,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:27,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash 433006761, now seen corresponding path program 2 times [2024-11-13 14:52:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:52:27,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421210907] [2024-11-13 14:52:27,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:52:27,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:52:27,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:52:27,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:52:27,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:52:27,968 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:52:27,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:52:27,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-13 14:52:27,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:52:27,996 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 7 [2024-11-13 14:52:28,082 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-13 14:52:28,093 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-13 14:52:28,335 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 14:52:28,335 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 16 treesize of output 15 [2024-11-13 14:52:28,374 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 14:52:28,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 14:52:28,389 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-13 14:52:28,463 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-13 14:52:28,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 14:52:28,844 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 14:52:28,845 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2024-11-13 14:52:28,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-13 14:52:28,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:52:37,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:52:37,226 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 14:52:37,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2024-11-13 14:52:37,300 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-13 14:52:37,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-11-13 14:52:37,385 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 14:52:37,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 14:52:37,607 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 14:52:37,608 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:52:37,654 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 14:52:37,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2024-11-13 14:52:37,662 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 0 case distinctions, treesize of input 116 treesize of output 69 [2024-11-13 14:52:37,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 14:52:37,894 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 116 treesize of output 80 [2024-11-13 14:52:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:52:38,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:52:40,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:40,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 423 treesize of output 385 [2024-11-13 14:52:40,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:40,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 336 [2024-11-13 14:52:45,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse14 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse0 (select .cse14 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse8 (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47|))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_8 (_ bv4 32)) .cse0)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47| v_arrayElimArr_8)) (.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47| v_arrayElimArr_7)) (.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 .cse5) .cse6)))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3)))))) (not (= .cse8 (select v_arrayElimArr_7 (_ bv4 32)))))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47| (_ BitVec 32))) (or (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_8 (_ bv4 32)) .cse0)) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse8 (select v_arrayElimArr_7 (_ bv4 32)))) (= (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47| v_arrayElimArr_8)) (.cse10 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47| v_arrayElimArr_7)) (.cse13 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select .cse10 .cse13) .cse6)) (.cse12 (bvadd (_ bv4 32) (select (select .cse9 .cse13) .cse6)))) (select (select .cse9 (select (select .cse10 .cse11) .cse12)) (bvadd (_ bv4 32) (select (select .cse9 .cse11) .cse12))))) (_ bv0 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_47|)))))))) is different from false [2024-11-13 14:52:45,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:52:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421210907] [2024-11-13 14:52:45,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421210907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:52:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1655953094] [2024-11-13 14:52:45,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:52:45,807 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 14:52:45,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 14:52:45,808 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 14:52:45,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-13 14:52:46,264 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:52:46,264 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:52:46,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-13 14:52:46,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:52:48,219 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 7 [2024-11-13 14:52:50,580 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-13 14:52:50,832 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-13 14:52:54,434 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 14:52:54,434 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 16 treesize of output 15 [2024-11-13 14:52:55,312 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 14:52:55,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 14:52:55,561 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-13 14:52:57,789 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-13 14:52:57,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 14:53:05,497 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 14:53:05,497 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2024-11-13 14:53:05,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:53:05,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-13 14:53:23,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:53:24,248 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 14:53:24,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2024-11-13 14:53:25,088 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-13 14:53:25,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-11-13 14:53:25,987 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 14:53:25,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 14:53:28,786 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 27 treesize of output 1 [2024-11-13 14:53:29,165 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 14:53:29,165 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 14:53:29,775 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 14:53:29,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2024-11-13 14:53:29,849 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 0 case distinctions, treesize of input 116 treesize of output 69 [2024-11-13 14:53:30,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:53:30,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 14:53:32,855 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 116 treesize of output 80 [2024-11-13 14:53:44,523 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-13 14:53:44,524 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 43 [2024-11-13 14:53:44,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 14:53:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:46,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:54:00,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:54:00,430 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 789 treesize of output 792 [2024-11-13 14:54:18,256 WARN L286 SmtUtils]: Spent 9.69s on a formula simplification. DAG size of input: 73 DAG size of output: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:54:20,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:54:20,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 651 treesize of output 591 [2024-11-13 14:54:20,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:54:20,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 581 treesize of output 521 [2024-11-13 14:55:50,414 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:55:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1655953094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:55:50,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:55:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 42 [2024-11-13 14:55:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727257990] [2024-11-13 14:55:50,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:55:50,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-13 14:55:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:55:50,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 14:55:50,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2901, Unknown=9, NotChecked=108, Total=3192 [2024-11-13 14:55:50,421 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 42 states, 40 states have (on average 1.25) internal successors, (50), 33 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:55:56,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:01,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:05,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:09,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:14,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:56:18,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:57:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:05,070 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-11-13 14:57:05,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 14:57:05,071 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.25) internal successors, (50), 33 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-13 14:57:05,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:05,072 INFO L225 Difference]: With dead ends: 62 [2024-11-13 14:57:05,072 INFO L226 Difference]: Without dead ends: 41 [2024-11-13 14:57:05,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 184.8s TimeCoverageRelationStatistics Valid=246, Invalid=3909, Unknown=9, NotChecked=126, Total=4290 [2024-11-13 14:57:05,074 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:05,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 336 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 730 Invalid, 6 Unknown, 0 Unchecked, 47.4s Time] [2024-11-13 14:57:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-13 14:57:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-13 14:57:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:57:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-13 14:57:05,088 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 37 [2024-11-13 14:57:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:05,088 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-13 14:57:05,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.25) internal successors, (50), 33 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:57:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-13 14:57:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-13 14:57:05,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:05,089 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:57:05,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-13 14:57:05,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 14:57:05,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:05,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:05,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:05,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1645711193, now seen corresponding path program 3 times [2024-11-13 14:57:05,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:57:05,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547361322] [2024-11-13 14:57:05,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:57:05,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:05,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:57:05,492 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:57:05,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 14:57:14,545 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-13 14:57:14,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:57:14,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 14:57:14,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:57:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 40 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 14:57:15,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:57:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-13 14:57:20,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:57:20,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547361322] [2024-11-13 14:57:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547361322] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:57:20,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:57:20,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2024-11-13 14:57:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138557763] [2024-11-13 14:57:20,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:57:20,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:57:20,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:57:20,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:57:20,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:57:20,110 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 14:57:20,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:20,957 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2024-11-13 14:57:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:57:20,958 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 53 [2024-11-13 14:57:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:20,958 INFO L225 Difference]: With dead ends: 46 [2024-11-13 14:57:20,959 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 14:57:20,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:57:20,960 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:20,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:57:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 14:57:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 14:57:20,961 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-13 14:57:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 14:57:20,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2024-11-13 14:57:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:20,961 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 14:57:20,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 14:57:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 14:57:20,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 14:57:20,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:57:20,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 14:57:21,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:21,168 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2024-11-13 14:57:21,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 14:57:28,452 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 58 DAG size of output: 56 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 14:57:39,201 WARN L286 SmtUtils]: Spent 9.27s on a formula simplification. DAG size of input: 155 DAG size of output: 128 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 14:57:41,521 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:57:41,538 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,539 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,539 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 14:57:41,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:57:41,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-13 14:57:41,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-13 14:57:41,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 14:57:41,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-13 14:57:41,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:57:41,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-13 14:57:41,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:57:41,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-13 14:57:41,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 14:57:41,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 14:57:41,546 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 14:57:41,547 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-13 14:57:41,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-13 14:57:41,548 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 14:57:41,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-13 14:57:41,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-13 14:57:41,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 14:57:41,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 14:57:41,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,551 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,552 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,552 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,554 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,554 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 14:57:41,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 14:57:41,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 14:57:41,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 14:57:41,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 14:57:41,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 14:57:41,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 14:57:41,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 14:57:41,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 14:57:41,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 14:57:41,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 14:57:41,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 14:57:41,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 14:57:41,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-13 14:57:41,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 14:57:41,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 14:57:41,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 14:57:41,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 14:57:41,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 14:57:41,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 14:57:41,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 14:57:41,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 14:57:41,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 14:57:41,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 14:57:41,562 WARN L162 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |#memory_$Pointer$#1.base| |old(#memory_$Pointer$#1.base)|) (= |old(#memory_int#1)| |#memory_int#1|) (= |old(#valid)| |#valid|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) Eliminated clause: true [2024-11-13 14:57:41,569 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 14:57:41,569 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 14:57:41,569 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,570 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:57:41,570 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#res!base,]]] [2024-11-13 14:57:41,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 14:57:41,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 14:57:41,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 14:57:41,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] [2024-11-13 14:57:41,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 14:57:41,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:57:41,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-13 14:57:41,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-13 14:57:41,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 14:57:41,572 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 14:57:41,574 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-13 14:57:41,574 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-13 14:57:41,574 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-13 14:57:41,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:57:41 BoogieIcfgContainer [2024-11-13 14:57:41,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:57:41,576 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:57:41,576 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:57:41,577 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:57:41,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:51:28" (3/4) ... [2024-11-13 14:57:41,582 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 14:57:41,587 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-13 14:57:41,591 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 14:57:41,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 14:57:41,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 14:57:41,593 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 14:57:41,687 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:57:41,687 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 14:57:41,689 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:57:41,689 INFO L158 Benchmark]: Toolchain (without parser) took 374088.12ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 91.6MB in the beginning and 175.9MB in the end (delta: -84.3MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2024-11-13 14:57:41,690 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:57:41,690 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.04ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 72.5MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:57:41,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.52ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 70.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:57:41,690 INFO L158 Benchmark]: Boogie Preprocessor took 73.94ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 68.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:57:41,690 INFO L158 Benchmark]: RCFGBuilder took 632.78ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 51.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:57:41,691 INFO L158 Benchmark]: TraceAbstraction took 372682.57ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 50.8MB in the beginning and 181.6MB in the end (delta: -130.8MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2024-11-13 14:57:41,691 INFO L158 Benchmark]: Witness Printer took 112.38ms. Allocated memory is still 243.3MB. Free memory was 181.6MB in the beginning and 175.9MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:57:41,695 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.32ms. Allocated memory is still 117.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.04ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 72.5MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.52ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 70.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.94ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 68.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 632.78ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 51.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 372682.57ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 50.8MB in the beginning and 181.6MB in the end (delta: -130.8MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. * Witness Printer took 112.38ms. Allocated memory is still 243.3MB. Free memory was 181.6MB in the beginning and 175.9MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#res!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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: 629]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 352.2s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 93.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 62.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 1809 SdHoareTripleChecker+Invalid, 61.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1619 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2716 IncrementalHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 190 mSDtfsCounter, 2716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 723 GetRequests, 449 SyntacticMatches, 3 SemanticMatches, 271 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2233 ImplicationChecksByTransitivity, 217.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=8, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 10.2s SatisfiabilityAnalysisTime, 243.3s InterpolantComputationTime, 472 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 600 ConstructedInterpolants, 72 QuantifiedInterpolants, 7605 SizeOfPredicates, 83 NumberOfNonLiveVariables, 2957 ConjunctsInSsa, 668 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 284/454 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 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((1 == count) && (2 == len)) && (data == 1)) || (((2 == count) && (2 == len)) && (data == 1))) || (((3 == count) && (2 == len)) && (data == 1))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((1 == data) && (len == 1)) && (2 == len)) && (data == 1)) || ((((1 == data) && (len == 0)) && (2 == len)) && (data == 1))) || ((((1 == data) && (len == 2)) && (2 == len)) && (data == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-13 14:57:41,921 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 14:57:42,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9a70d95-4c4b-428f-9a8b-6820564d950b/bin/uautomizer-verify-qhAvR1uOyd/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