./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB --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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:30:16,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:30:17,119 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:30:17,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:30:17,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:30:17,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:30:17,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:30:17,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:30:17,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:30:17,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:30:17,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:30:17,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:30:17,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:30:17,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:30:17,176 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:30:17,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:30:17,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:30:17,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:30:17,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:30:17,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:30:17,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:30:17,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:30:17,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:30:17,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:30:17,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:30:17,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:30:17,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:30:17,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:30:17,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:30:17,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:30:17,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:30:17,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:30:17,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:17,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:30:17,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:30:17,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:30:17,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:30:17,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:17,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:30:17,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:30:17,183 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:30:17,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:30:17,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:30:17,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:30:17,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:30:17,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:30:17,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:30:17,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:30:17,184 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_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2024-11-27 23:30:17,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:30:17,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:30:17,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:30:17,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:30:17,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:30:17,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-11-27 23:30:21,134 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/data/54f4726b3/78e32e1d0c604b39b90b725e2f9ba669/FLAG1633a6c2a [2024-11-27 23:30:21,543 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:30:21,546 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-11-27 23:30:21,567 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/data/54f4726b3/78e32e1d0c604b39b90b725e2f9ba669/FLAG1633a6c2a [2024-11-27 23:30:21,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/data/54f4726b3/78e32e1d0c604b39b90b725e2f9ba669 [2024-11-27 23:30:21,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:30:21,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:30:21,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:30:21,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:30:21,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:30:21,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:30:21" (1/1) ... [2024-11-27 23:30:21,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12227630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:21, skipping insertion in model container [2024-11-27 23:30:21,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:30:21" (1/1) ... [2024-11-27 23:30:21,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:30:22,143 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_3ca43d30-0fb8-47be-a790-0390198ec8ad/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2024-11-27 23:30:22,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:30:22,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:30:22,234 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_3ca43d30-0fb8-47be-a790-0390198ec8ad/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2024-11-27 23:30:22,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:30:22,273 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:30:22,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22 WrapperNode [2024-11-27 23:30:22,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:30:22,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:30:22,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:30:22,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:30:22,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,341 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 104 [2024-11-27 23:30:22,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:30:22,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:30:22,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:30:22,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:30:22,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,408 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 9, 11]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 11 writes are split as follows [0, 2, 9]. [2024-11-27 23:30:22,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:30:22,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:30:22,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:30:22,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:30:22,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (1/1) ... [2024-11-27 23:30:22,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:22,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:22,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:30:22,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:30:22,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 23:30:22,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 23:30:22,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 23:30:22,537 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-27 23:30:22,538 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-27 23:30:22,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:30:22,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:30:22,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 23:30:22,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 23:30:22,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 23:30:22,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 23:30:22,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 23:30:22,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 23:30:22,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 23:30:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:30:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 23:30:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 23:30:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 23:30:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:30:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 23:30:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 23:30:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:30:22,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:30:22,750 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:30:22,752 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:30:23,085 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-27 23:30:23,085 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:30:23,097 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:30:23,097 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 23:30:23,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:23 BoogieIcfgContainer [2024-11-27 23:30:23,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:30:23,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:30:23,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:30:23,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:30:23,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:30:21" (1/3) ... [2024-11-27 23:30:23,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ca7dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:30:23, skipping insertion in model container [2024-11-27 23:30:23,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:22" (2/3) ... [2024-11-27 23:30:23,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ca7dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:30:23, skipping insertion in model container [2024-11-27 23:30:23,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:23" (3/3) ... [2024-11-27 23:30:23,115 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2024-11-27 23:30:23,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:30:23,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all.i that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-27 23:30:23,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:30:23,244 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;@38aa5c51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:30:23,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:30:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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-27 23:30:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 23:30:23,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:23,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:23,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:23,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1539895108, now seen corresponding path program 1 times [2024-11-27 23:30:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191590884] [2024-11-27 23:30:23,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:23,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:23,638 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-27 23:30:23,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191590884] [2024-11-27 23:30:23,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191590884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:23,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:23,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:30:23,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511593501] [2024-11-27 23:30:23,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:23,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:30:23,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:23,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:30:23,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:30:23,717 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-27 23:30:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:23,742 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-11-27 23:30:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:30:23,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 16 [2024-11-27 23:30:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:23,752 INFO L225 Difference]: With dead ends: 41 [2024-11-27 23:30:23,753 INFO L226 Difference]: Without dead ends: 24 [2024-11-27 23:30:23,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:30:23,765 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:23,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-27 23:30:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-27 23:30:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-27 23:30:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-27 23:30:23,814 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2024-11-27 23:30:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:23,817 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-27 23:30:23,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-27 23:30:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-27 23:30:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 23:30:23,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:23,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:23,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:30:23,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:23,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:23,822 INFO L85 PathProgramCache]: Analyzing trace with hash -520214472, now seen corresponding path program 1 times [2024-11-27 23:30:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144897819] [2024-11-27 23:30:23,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:24,106 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-27 23:30:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144897819] [2024-11-27 23:30:24,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144897819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:24,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:24,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:30:24,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272760574] [2024-11-27 23:30:24,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:24,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:30:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:24,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:30:24,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:24,116 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-27 23:30:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:24,138 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-27 23:30:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:30:24,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2024-11-27 23:30:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:24,140 INFO L225 Difference]: With dead ends: 39 [2024-11-27 23:30:24,140 INFO L226 Difference]: Without dead ends: 29 [2024-11-27 23:30:24,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:24,141 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 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-27 23:30:24,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-27 23:30:24,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-11-27 23:30:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-27 23:30:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-27 23:30:24,149 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2024-11-27 23:30:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:24,149 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-27 23:30:24,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-27 23:30:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-27 23:30:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-27 23:30:24,150 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:24,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:24,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:30:24,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:24,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:24,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1349754135, now seen corresponding path program 1 times [2024-11-27 23:30:24,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:24,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488255672] [2024-11-27 23:30:24,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:24,795 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-27 23:30:24,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488255672] [2024-11-27 23:30:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488255672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707578872] [2024-11-27 23:30:24,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:24,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:24,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:24,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:24,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:30:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:25,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 23:30:25,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-27 23:30:25,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:30:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707578872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:25,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:30:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-27 23:30:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542242372] [2024-11-27 23:30:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:25,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:30:25,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:25,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:30:25,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:30:25,229 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-27 23:30:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:25,274 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-11-27 23:30:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:30:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 26 [2024-11-27 23:30:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:25,276 INFO L225 Difference]: With dead ends: 33 [2024-11-27 23:30:25,276 INFO L226 Difference]: Without dead ends: 29 [2024-11-27 23:30:25,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:30:25,278 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:25,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 46 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-27 23:30:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-27 23:30:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-27 23:30:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-27 23:30:25,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 26 [2024-11-27 23:30:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:25,288 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-27 23:30:25,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-27 23:30:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-27 23:30:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-27 23:30:25,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:25,290 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:25,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 23:30:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-27 23:30:25,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1382591313, now seen corresponding path program 1 times [2024-11-27 23:30:25,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:25,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330397277] [2024-11-27 23:30:25,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:25,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:30:25,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:25,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330397277] [2024-11-27 23:30:25,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330397277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:25,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690142943] [2024-11-27 23:30:25,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:25,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:25,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:25,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:25,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:30:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:26,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 23:30:26,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-27 23:30:26,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-27 23:30:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690142943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:30:26,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:30:26,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-27 23:30:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526463937] [2024-11-27 23:30:26,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:30:26,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:30:26,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:26,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:30:26,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:30:26,450 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 23:30:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:26,569 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-27 23:30:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:30:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2024-11-27 23:30:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:26,571 INFO L225 Difference]: With dead ends: 41 [2024-11-27 23:30:26,571 INFO L226 Difference]: Without dead ends: 37 [2024-11-27 23:30:26,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:30:26,573 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:26,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 107 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:30:26,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-27 23:30:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2024-11-27 23:30:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-27 23:30:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-27 23:30:26,588 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 30 [2024-11-27 23:30:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:26,588 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-27 23:30:26,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 23:30:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-27 23:30:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 23:30:26,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:26,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:26,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 23:30:26,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:26,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:26,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 597327801, now seen corresponding path program 2 times [2024-11-27 23:30:26,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:26,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267406695] [2024-11-27 23:30:26,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:30:26,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:26,872 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:30:26,872 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:30:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 23:30:27,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267406695] [2024-11-27 23:30:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267406695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:30:27,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830319186] [2024-11-27 23:30:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:27,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:30:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:27,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:30:27,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:30:27,470 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-27 23:30:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:27,619 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-27 23:30:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:30:27,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 34 [2024-11-27 23:30:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:27,625 INFO L225 Difference]: With dead ends: 40 [2024-11-27 23:30:27,625 INFO L226 Difference]: Without dead ends: 36 [2024-11-27 23:30:27,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:30:27,626 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:27,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:30:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-27 23:30:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2024-11-27 23:30:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-27 23:30:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-27 23:30:27,642 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 34 [2024-11-27 23:30:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:27,643 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-27 23:30:27,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-27 23:30:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-27 23:30:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 23:30:27,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:27,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:27,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:30:27,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:27,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:27,647 INFO L85 PathProgramCache]: Analyzing trace with hash 654586103, now seen corresponding path program 1 times [2024-11-27 23:30:27,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:27,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975266894] [2024-11-27 23:30:27,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:27,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 23:30:29,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:29,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975266894] [2024-11-27 23:30:29,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975266894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:29,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879092974] [2024-11-27 23:30:29,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:29,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:29,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:29,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:29,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:30:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:29,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-27 23:30:29,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:29,560 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-27 23:30:29,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:30:29,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 23:30:29,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 23:30:29,844 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-27 23:30:29,991 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-27 23:30:29,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 83 [2024-11-27 23:30:30,005 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 0 case distinctions, treesize of input 63 treesize of output 53 [2024-11-27 23:30:30,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 160 treesize of output 112 [2024-11-27 23:30:30,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 109 treesize of output 69 [2024-11-27 23:30:30,322 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 23:30:30,322 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 73 treesize of output 52 [2024-11-27 23:30:30,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:30,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2024-11-27 23:30:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 23:30:30,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:30,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-27 23:30:30,427 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 21 treesize of output 13 [2024-11-27 23:30:30,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2024-11-27 23:30:30,482 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-27 23:30:30,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:30,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-27 23:30:30,616 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 65 treesize of output 57 [2024-11-27 23:30:30,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-27 23:30:30,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-27 23:30:30,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-27 23:30:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2024-11-27 23:30:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879092974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:30:31,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:30:31,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2024-11-27 23:30:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254366233] [2024-11-27 23:30:31,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:30:31,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-27 23:30:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:31,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-27 23:30:31,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=903, Unknown=14, NotChecked=122, Total=1122 [2024-11-27 23:30:31,140 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 27 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-27 23:30:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:32,339 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-27 23:30:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 23:30:32,339 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 27 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-11-27 23:30:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:32,342 INFO L225 Difference]: With dead ends: 51 [2024-11-27 23:30:32,342 INFO L226 Difference]: Without dead ends: 41 [2024-11-27 23:30:32,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=122, Invalid=1277, Unknown=15, NotChecked=146, Total=1560 [2024-11-27 23:30:32,344 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:32,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 344 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 370 Invalid, 0 Unknown, 54 Unchecked, 0.7s Time] [2024-11-27 23:30:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-27 23:30:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-27 23:30:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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-27 23:30:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-27 23:30:32,355 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 34 [2024-11-27 23:30:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:32,355 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-27 23:30:32,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 27 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-27 23:30:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-27 23:30:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 23:30:32,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:32,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:32,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 23:30:32,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:32,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:32,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash 261559093, now seen corresponding path program 1 times [2024-11-27 23:30:32,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:32,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069494870] [2024-11-27 23:30:32,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:32,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:35,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069494870] [2024-11-27 23:30:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069494870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245069017] [2024-11-27 23:30:35,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:35,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:35,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:35,731 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:35,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:30:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:35,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-27 23:30:36,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:36,011 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-27 23:30:36,138 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:30:36,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 23:30:36,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 23:30:36,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 23:30:36,218 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-27 23:30:36,236 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-27 23:30:36,336 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2024-11-27 23:30:36,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 114 [2024-11-27 23:30:36,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 84 [2024-11-27 23:30:36,371 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 51 treesize of output 29 [2024-11-27 23:30:37,081 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 293 treesize of output 185 [2024-11-27 23:30:37,124 INFO L349 Elim1Store]: treesize reduction 84, result has 5.6 percent of original size [2024-11-27 23:30:37,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 193 treesize of output 168 [2024-11-27 23:30:37,177 INFO L349 Elim1Store]: treesize reduction 86, result has 9.5 percent of original size [2024-11-27 23:30:37,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 106 [2024-11-27 23:30:37,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 85 [2024-11-27 23:30:37,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2024-11-27 23:30:37,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2024-11-27 23:30:37,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 23:30:37,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2024-11-27 23:30:37,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:30:37,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:30:37,568 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-27 23:30:37,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 209 treesize of output 106 [2024-11-27 23:30:37,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:30:37,580 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 34 treesize of output 26 [2024-11-27 23:30:37,584 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:30:37,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-27 23:30:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:37,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:38,020 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 356 treesize of output 260 [2024-11-27 23:30:38,028 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 264 treesize of output 168 [2024-11-27 23:30:38,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse3 (+ .cse7 4)) (.cse6 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_754))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store .cse5 .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_756) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1))) (store .cse2 .cse0 (store (select .cse2 .cse0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse0))) .cse0) .cse7)))))) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_762 Int) (v_ArrVal_760 (Array Int Int))) (= .cse7 (select (let ((.cse9 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_754) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (let ((.cse8 (store .cse12 .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse8) .cse9 v_ArrVal_760) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse10 (store .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse8))) (store .cse10 .cse9 (store (select .cse10 .cse9) .cse3 v_ArrVal_762))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse7))) .cse9)) .cse7)))))))) is different from false [2024-11-27 23:30:38,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse4 (+ 4 .cse0)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_762 Int) (v_ArrVal_760 (Array Int Int))) (= .cse0 (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_754) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (let ((.cse1 (store .cse6 .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_760) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse3 (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_762))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse0))) .cse2)) .cse0))) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_754))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (let ((.cse8 (store .cse12 .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse8) .cse9 v_ArrVal_756) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse10 (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse8))) (store .cse10 .cse9 (store (select .cse10 .cse9) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse9))) .cse9) .cse0) .cse9)))))))))) is different from false [2024-11-27 23:30:38,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_762 Int) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_749))) (let ((.cse5 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_750) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_754) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (let ((.cse2 (store .cse6 .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2) .cse3 v_ArrVal_760) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse4 (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ .cse0 4) v_ArrVal_762))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse0))) .cse3)) .cse0))))))) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_750))) (let ((.cse13 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_754))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (let ((.cse12 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_749))) (store .cse15 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (let ((.cse9 (store .cse14 .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse9) .cse10 v_ArrVal_756) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse11 (store .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse9))) (store .cse11 .cse10 (store (select .cse11 .cse10) (+ .cse12 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse10))) .cse10) .cse12)) .cse10)))))))) is different from false [2024-11-27 23:30:38,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:38,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 268 [2024-11-27 23:30:38,456 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-11-27 23:30:38,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25745 treesize of output 19155 [2024-11-27 23:30:38,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:38,541 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 8038 treesize of output 7772 [2024-11-27 23:30:38,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:38,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 12297 treesize of output 11933 [2024-11-27 23:30:39,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:39,298 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 1903 treesize of output 1835 [2024-11-27 23:30:39,379 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 1820 treesize of output 1730 [2024-11-27 23:30:39,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:39,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2041 treesize of output 1908 [2024-11-27 23:30:39,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:39,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 200 treesize of output 236 [2024-11-27 23:30:44,893 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 20 treesize of output 16 [2024-11-27 23:30:44,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:30:44,916 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:30:44,933 INFO L349 Elim1Store]: treesize reduction 131, result has 0.8 percent of original size [2024-11-27 23:30:44,933 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 4 case distinctions, treesize of input 3179 treesize of output 1 [2024-11-27 23:30:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245069017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:45,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:30:45,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2024-11-27 23:30:45,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820877264] [2024-11-27 23:30:45,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:30:45,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-27 23:30:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:45,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-27 23:30:45,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=686, Unknown=5, NotChecked=162, Total=930 [2024-11-27 23:30:45,159 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (2), 2 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-27 23:30:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:46,312 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-27 23:30:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 23:30:46,313 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (2), 2 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 34 [2024-11-27 23:30:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:46,314 INFO L225 Difference]: With dead ends: 55 [2024-11-27 23:30:46,314 INFO L226 Difference]: Without dead ends: 45 [2024-11-27 23:30:46,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=102, Invalid=897, Unknown=5, NotChecked=186, Total=1190 [2024-11-27 23:30:46,316 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:46,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 274 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 23:30:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-27 23:30:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-27 23:30:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 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-27 23:30:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-27 23:30:46,336 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 34 [2024-11-27 23:30:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:46,337 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-27 23:30:46,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (2), 2 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-27 23:30:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-27 23:30:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 23:30:46,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:46,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:46,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 23:30:46,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:46,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:46,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1822499997, now seen corresponding path program 2 times [2024-11-27 23:30:46,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:46,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293850259] [2024-11-27 23:30:46,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:30:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:46,596 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:30:46,596 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:30:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-27 23:30:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293850259] [2024-11-27 23:30:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293850259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115972632] [2024-11-27 23:30:46,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:30:46,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:46,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:46,740 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:46,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 23:30:47,055 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:30:47,055 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:30:47,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 23:30:47,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-27 23:30:47,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:30:47,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115972632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:47,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:30:47,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-27 23:30:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281379971] [2024-11-27 23:30:47,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:47,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:30:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:47,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:30:47,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:30:47,185 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-27 23:30:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:47,217 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-11-27 23:30:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:30:47,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 38 [2024-11-27 23:30:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:47,218 INFO L225 Difference]: With dead ends: 56 [2024-11-27 23:30:47,218 INFO L226 Difference]: Without dead ends: 35 [2024-11-27 23:30:47,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:30:47,219 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:47,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-27 23:30:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-27 23:30:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 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-27 23:30:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-27 23:30:47,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 38 [2024-11-27 23:30:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:47,228 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-27 23:30:47,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-27 23:30:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-27 23:30:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 23:30:47,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:47,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:47,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 23:30:47,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:47,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:47,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2063958376, now seen corresponding path program 3 times [2024-11-27 23:30:47,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:47,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118772098] [2024-11-27 23:30:47,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:30:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:47,475 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-27 23:30:47,476 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:30:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-27 23:30:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118772098] [2024-11-27 23:30:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118772098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787096439] [2024-11-27 23:30:47,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:30:47,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:47,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:47,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:47,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 23:30:47,871 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-27 23:30:47,871 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:30:47,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 23:30:47,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-27 23:30:47,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:30:47,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787096439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:47,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:30:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-27 23:30:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888439323] [2024-11-27 23:30:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:47,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:30:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:47,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:30:47,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:30:47,911 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:30:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:47,928 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-27 23:30:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:30:47,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-11-27 23:30:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:47,929 INFO L225 Difference]: With dead ends: 40 [2024-11-27 23:30:47,929 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 23:30:47,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:30:47,930 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 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-27 23:30:47,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 23:30:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 23:30:47,931 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-27 23:30:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 23:30:47,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-11-27 23:30:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:47,932 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 23:30:47,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:30:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 23:30:47,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 23:30:47,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:30:47,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 23:30:48,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:48,141 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-11-27 23:30:48,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-27 23:30:48,488 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:30:48,507 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-27 23:30:48,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-27 23:30:48,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-27 23:30:48,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-27 23:30:48,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-27 23:30:48,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-27 23:30:48,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-27 23:30:48,509 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-27 23:30:48,509 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-27 23:30:48,509 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-27 23:30:48,509 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-27 23:30:48,509 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-27 23:30:48,509 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-27 23:30:48,509 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-27 23:30:48,510 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-27 23:30:48,510 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-27 23:30:48,510 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-27 23:30:48,510 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-27 23:30:48,510 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-27 23:30:48,510 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-27 23:30:48,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-27 23:30:48,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-27 23:30:48,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-27 23:30:48,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-27 23:30:48,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-27 23:30:48,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-27 23:30:48,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-27 23:30:48,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-27 23:30:48,512 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-27 23:30:48,512 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-27 23:30:48,512 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[0]]]]] [2024-11-27 23:30:48,512 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-27 23:30:48,512 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-27 23:30:48,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-27 23:30:48,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-27 23:30:48,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-27 23:30:48,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-27 23:30:48,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-27 23:30:48,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-27 23:30:48,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] [2024-11-27 23:30:48,514 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-27 23:30:48,514 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-27 23:30:48,514 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-27 23:30:48,517 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-27 23:30:48,517 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-27 23:30:48,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-27 23:30:48,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-27 23:30:48,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-27 23:30:48,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-27 23:30:48,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-27 23:30:48,518 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-27 23:30:48,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-27 23:30:48,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-27 23:30:48,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-27 23:30:48,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-27 23:30:48,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-27 23:30:48,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-27 23:30:48,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-27 23:30:48,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-27 23:30:48,520 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-27 23:30:48,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:30:48 BoogieIcfgContainer [2024-11-27 23:30:48,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:30:48,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:30:48,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:30:48,521 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:30:48,522 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:23" (3/4) ... [2024-11-27 23:30:48,525 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 23:30:48,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-27 23:30:48,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-27 23:30:48,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-27 23:30:48,537 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-27 23:30:48,537 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 23:30:48,634 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:30:48,635 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:30:48,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:30:48,636 INFO L158 Benchmark]: Toolchain (without parser) took 27036.79ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 93.2MB in the beginning and 205.5MB in the end (delta: -112.4MB). Peak memory consumption was 290.0MB. Max. memory is 16.1GB. [2024-11-27 23:30:48,636 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:30:48,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.40ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 75.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:30:48,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.65ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:30:48,637 INFO L158 Benchmark]: Boogie Preprocessor took 107.51ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 71.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:30:48,637 INFO L158 Benchmark]: RCFGBuilder took 647.13ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 56.0MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:30:48,638 INFO L158 Benchmark]: TraceAbstraction took 25418.13ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 55.4MB in the beginning and 209.8MB in the end (delta: -154.4MB). Peak memory consumption was 256.5MB. Max. memory is 16.1GB. [2024-11-27 23:30:48,638 INFO L158 Benchmark]: Witness Printer took 114.20ms. Allocated memory is still 520.1MB. Free memory was 209.8MB in the beginning and 205.5MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:30:48,640 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.52ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 670.40ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 75.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.65ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 107.51ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 71.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 647.13ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 56.0MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25418.13ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 55.4MB in the beginning and 209.8MB in the end (delta: -154.4MB). Peak memory consumption was 256.5MB. Max. memory is 16.1GB. * Witness Printer took 114.20ms. Allocated memory is still 520.1MB. Free memory was 209.8MB in the beginning and 205.5MB in the end (delta: 4.3MB). There was no memory consumed. 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],[IdentifierExpression[~#s~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],[IdentifierExpression[~#s~0!base,]]] - 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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~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],[IdentifierExpression[~#s~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],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - 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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - 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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]],[IntegerLiteral[0]]]]] - 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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IdentifierExpression[~#s~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],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - 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[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - 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: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base * 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: 627]: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 1033 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 54 IncrementalHoareTripleChecker+Unchecked, 823 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 804 IncrementalHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 210 mSDtfsCounter, 804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 257 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=7, InterpolantAutomatonStates: 62, 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, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 478 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 525 ConstructedInterpolants, 15 QuantifiedInterpolants, 3820 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2001 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 161/203 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: ((((2 <= i) && (len == 2)) || ((i == 1) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2024-11-27 23:30:48,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ca43d30-0fb8-47be-a790-0390198ec8ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE