./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.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_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/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_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/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_56748ffb-4f0b-442a-9723-43d1552c74c9/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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:29:51,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:29:51,802 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:29:51,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:29:51,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:29:51,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:29:51,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:29:51,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:29:51,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:29:51,853 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:29:51,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:29:51,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:29:51,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:29:51,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:29:51,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:29:51,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:29:51,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:29:51,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:29:51,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:29:51,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:29:51,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:29:51,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:29:51,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:29:51,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:29:51,855 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:29:51,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:29:51,856 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:29:51,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:29:51,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:29:51,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:29:51,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:29:51,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:29:51,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:29:51,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:29:51,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:29:51,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:29:51,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:29:51,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:29:51,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:29:51,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:29:51,857 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:29:51,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:29:51,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:29:51,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:29:51,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:29:51,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:29:51,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:29:51,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:29:51,858 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_56748ffb-4f0b-442a-9723-43d1552c74c9/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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2024-11-27 20:29:52,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:29:52,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:29:52,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:29:52,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:29:52,244 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:29:52,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-11-27 20:29:55,772 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data/12cf3d67b/dc9e2a268b814be499c8a5065d5136cd/FLAG643955b84 [2024-11-27 20:29:56,246 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:29:56,247 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-11-27 20:29:56,263 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data/12cf3d67b/dc9e2a268b814be499c8a5065d5136cd/FLAG643955b84 [2024-11-27 20:29:56,282 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data/12cf3d67b/dc9e2a268b814be499c8a5065d5136cd [2024-11-27 20:29:56,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:29:56,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:29:56,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:29:56,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:29:56,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:29:56,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:56,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106a41eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56, skipping insertion in model container [2024-11-27 20:29:56,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:56,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:29:56,787 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_56748ffb-4f0b-442a-9723-43d1552c74c9/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2024-11-27 20:29:56,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:29:56,803 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:29:56,861 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_56748ffb-4f0b-442a-9723-43d1552c74c9/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2024-11-27 20:29:56,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:29:56,907 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:29:56,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56 WrapperNode [2024-11-27 20:29:56,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:29:56,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:29:56,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:29:56,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:29:56,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:56,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:56,975 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2024-11-27 20:29:56,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:29:56,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:29:56,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:29:56,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:29:56,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:56,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:56,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:57,021 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-11-27 20:29:57,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:57,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:57,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:57,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:57,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:57,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:57,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:57,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:29:57,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:29:57,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:29:57,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:29:57,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (1/1) ... [2024-11-27 20:29:57,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:29:57,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:29:57,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:29:57,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:29:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 20:29:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 20:29:57,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 20:29:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 20:29:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 20:29:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 20:29:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-27 20:29:57,155 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-27 20:29:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:29:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:29:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:29:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:29:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:29:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:29:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:29:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:29:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:29:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:29:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 20:29:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 20:29:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 20:29:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:29:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:29:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 20:29:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:29:57,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:29:57,375 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:29:57,378 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:29:57,747 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-27 20:29:57,747 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:29:57,764 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:29:57,765 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-27 20:29:57,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:29:57 BoogieIcfgContainer [2024-11-27 20:29:57,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:29:57,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:29:57,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:29:57,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:29:57,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:29:56" (1/3) ... [2024-11-27 20:29:57,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799a7c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:29:57, skipping insertion in model container [2024-11-27 20:29:57,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:56" (2/3) ... [2024-11-27 20:29:57,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799a7c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:29:57, skipping insertion in model container [2024-11-27 20:29:57,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:29:57" (3/3) ... [2024-11-27 20:29:57,780 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2024-11-27 20:29:57,798 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:29:57,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_unequal.i that has 2 procedures, 37 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-27 20:29:57,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:29:57,872 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;@7bbcc685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:29:57,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:29:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 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 20:29:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 20:29:57,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:57,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:57,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:57,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash 134853294, now seen corresponding path program 1 times [2024-11-27 20:29:57,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:57,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208291582] [2024-11-27 20:29:57,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:58,626 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 20:29:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:58,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208291582] [2024-11-27 20:29:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208291582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:58,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:58,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710876353] [2024-11-27 20:29:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:58,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:58,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:58,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:58,677 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20:29:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:58,736 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2024-11-27 20:29:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:58,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2024-11-27 20:29:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:58,751 INFO L225 Difference]: With dead ends: 72 [2024-11-27 20:29:58,752 INFO L226 Difference]: Without dead ends: 33 [2024-11-27 20:29:58,758 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 20:29:58,763 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 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 20:29:58,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-27 20:29:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-27 20:29:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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 20:29:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-27 20:29:58,831 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 20 [2024-11-27 20:29:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:58,831 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-27 20:29:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20:29:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-27 20:29:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-27 20:29:58,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:58,835 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] [2024-11-27 20:29:58,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:29:58,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:58,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:58,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1007263779, now seen corresponding path program 1 times [2024-11-27 20:29:58,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:58,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856603040] [2024-11-27 20:29:58,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:59,271 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 20:29:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856603040] [2024-11-27 20:29:59,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856603040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:29:59,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308795528] [2024-11-27 20:29:59,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:59,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:29:59,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:29:59,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:29:59,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:29:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:59,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:29:59,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:29:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:59,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:29:59,759 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 20:29:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308795528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:29:59,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:29:59,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-27 20:29:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307078436] [2024-11-27 20:29:59,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:29:59,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:29:59,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:59,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:29:59,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:59,768 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-27 20:29:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:59,835 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2024-11-27 20:29:59,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:29:59,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-27 20:29:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:59,838 INFO L225 Difference]: With dead ends: 59 [2024-11-27 20:29:59,839 INFO L226 Difference]: Without dead ends: 34 [2024-11-27 20:29:59,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:59,841 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:59,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-27 20:29:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-27 20:29:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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 20:29:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-27 20:29:59,857 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 28 [2024-11-27 20:29:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:59,858 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-27 20:29:59,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-27 20:29:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-11-27 20:29:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-27 20:29:59,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:59,861 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:59,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:30:00,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:00,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:30:00,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash -776084088, now seen corresponding path program 2 times [2024-11-27 20:30:00,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:00,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255054367] [2024-11-27 20:30:00,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:30:00,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:00,130 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:30:00,130 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:30:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:30:00,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:00,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255054367] [2024-11-27 20:30:00,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255054367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:30:00,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:30:00,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:30:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228048277] [2024-11-27 20:30:00,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:30:00,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:30:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:00,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:30:00,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:30:00,262 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20:30:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:00,298 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-11-27 20:30:00,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:30:00,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 36 [2024-11-27 20:30:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:00,300 INFO L225 Difference]: With dead ends: 50 [2024-11-27 20:30:00,300 INFO L226 Difference]: Without dead ends: 37 [2024-11-27 20:30:00,300 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 20:30:00,301 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 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 20:30:00,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:30:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-27 20:30:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-11-27 20:30:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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 20:30:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-11-27 20:30:00,320 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 36 [2024-11-27 20:30:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:00,320 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-27 20:30:00,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20:30:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-27 20:30:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-27 20:30:00,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:00,323 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:00,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:30:00,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:30:00,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:00,325 INFO L85 PathProgramCache]: Analyzing trace with hash 998923274, now seen corresponding path program 1 times [2024-11-27 20:30:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455414449] [2024-11-27 20:30:00,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 20:30:00,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455414449] [2024-11-27 20:30:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455414449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78491320] [2024-11-27 20:30:00,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:00,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:00,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:30:00,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:30:00,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:30:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:01,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:30:01,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:30:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:30:01,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:30:01,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78491320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:30:01,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:30:01,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-27 20:30:01,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851855859] [2024-11-27 20:30:01,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:30:01,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:30:01,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:01,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:30:01,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:30:01,149 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20:30:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:01,237 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-11-27 20:30:01,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:30:01,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 36 [2024-11-27 20:30:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:01,239 INFO L225 Difference]: With dead ends: 51 [2024-11-27 20:30:01,239 INFO L226 Difference]: Without dead ends: 37 [2024-11-27 20:30:01,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:30:01,241 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:01,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:30:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-27 20:30:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-27 20:30:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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 20:30:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-11-27 20:30:01,257 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 36 [2024-11-27 20:30:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:01,259 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-27 20:30:01,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20:30:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-11-27 20:30:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:30:01,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:01,261 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:01,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:30:01,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:01,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:30:01,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:01,462 INFO L85 PathProgramCache]: Analyzing trace with hash -847115540, now seen corresponding path program 1 times [2024-11-27 20:30:01,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:01,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915328855] [2024-11-27 20:30:01,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:30:04,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:04,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915328855] [2024-11-27 20:30:04,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915328855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:04,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941036008] [2024-11-27 20:30:04,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:04,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:04,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:30:04,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:30:04,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:30:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:04,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-27 20:30:04,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:30:04,943 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 20:30:04,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:30:05,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:30:05,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:30:05,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-27 20:30:05,868 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 20:30:05,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-27 20:30:05,918 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-27 20:30:05,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-27 20:30:06,448 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 39 treesize of output 15 [2024-11-27 20:30:06,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 20:30:06,715 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 19 treesize of output 11 [2024-11-27 20:30:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:30:06,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:30:15,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941036008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:15,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:30:15,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2024-11-27 20:30:15,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60575894] [2024-11-27 20:30:15,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:30:15,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-27 20:30:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:15,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-27 20:30:15,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1318, Unknown=39, NotChecked=0, Total=1482 [2024-11-27 20:30:15,719 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 34 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:30:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:17,534 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2024-11-27 20:30:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-27 20:30:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2024-11-27 20:30:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:17,536 INFO L225 Difference]: With dead ends: 66 [2024-11-27 20:30:17,536 INFO L226 Difference]: Without dead ends: 64 [2024-11-27 20:30:17,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=175, Invalid=2041, Unknown=40, NotChecked=0, Total=2256 [2024-11-27 20:30:17,541 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:17,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 357 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 20:30:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-27 20:30:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2024-11-27 20:30:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:30:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-27 20:30:17,568 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 38 [2024-11-27 20:30:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:17,569 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-27 20:30:17,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:30:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-27 20:30:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:30:17,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:17,572 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:17,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:30:17,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:17,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:30:17,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash -847047030, now seen corresponding path program 1 times [2024-11-27 20:30:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159909493] [2024-11-27 20:30:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:30:18,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:18,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159909493] [2024-11-27 20:30:18,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159909493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:18,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038002370] [2024-11-27 20:30:18,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:18,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:18,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:30:18,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:30:18,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:30:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:18,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-27 20:30:18,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:30:19,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-27 20:30:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:30:19,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:30:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-27 20:30:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038002370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:30:19,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:30:19,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 18 [2024-11-27 20:30:19,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135208447] [2024-11-27 20:30:19,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:30:19,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 20:30:19,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:19,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 20:30:19,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-27 20:30:19,334 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-27 20:30:23,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:27,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:31,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:35,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:36,128 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2024-11-27 20:30:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:30:36,129 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 38 [2024-11-27 20:30:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:36,130 INFO L225 Difference]: With dead ends: 77 [2024-11-27 20:30:36,130 INFO L226 Difference]: Without dead ends: 69 [2024-11-27 20:30:36,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2024-11-27 20:30:36,132 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 68 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:36,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 451 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2024-11-27 20:30:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-27 20:30:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2024-11-27 20:30:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:30:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2024-11-27 20:30:36,149 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 38 [2024-11-27 20:30:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:36,149 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-11-27 20:30:36,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-27 20:30:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2024-11-27 20:30:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:30:36,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:36,151 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:36,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:30:36,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:36,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:30:36,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash 927891822, now seen corresponding path program 1 times [2024-11-27 20:30:36,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:36,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463594778] [2024-11-27 20:30:36,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:36,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-27 20:30:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463594778] [2024-11-27 20:30:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463594778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983508210] [2024-11-27 20:30:36,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:36,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:36,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:30:36,787 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:30:36,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:30:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:37,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-27 20:30:37,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:30:37,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:30:37,175 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 20:30:37,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:30:37,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-27 20:30:37,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:30:37,885 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-27 20:30:37,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-27 20:30:37,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 20:30:38,567 INFO L349 Elim1Store]: treesize reduction 63, result has 27.6 percent of original size [2024-11-27 20:30:38,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 53 [2024-11-27 20:30:38,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:30:38,618 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-27 20:30:38,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 21 [2024-11-27 20:30:38,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 20:30:39,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:30:39,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 178 [2024-11-27 20:30:39,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:30:39,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 151 [2024-11-27 20:30:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:30:42,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:30:43,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_693 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_693) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-27 20:30:43,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983508210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:43,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:30:43,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 27 [2024-11-27 20:30:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080687502] [2024-11-27 20:30:43,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:30:43,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-27 20:30:43,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:43,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-27 20:30:43,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1038, Unknown=1, NotChecked=64, Total=1190 [2024-11-27 20:30:43,876 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 23 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:30:48,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:49,336 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-11-27 20:30:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:30:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 23 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2024-11-27 20:30:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:49,338 INFO L225 Difference]: With dead ends: 65 [2024-11-27 20:30:49,338 INFO L226 Difference]: Without dead ends: 52 [2024-11-27 20:30:49,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=145, Invalid=1750, Unknown=1, NotChecked=84, Total=1980 [2024-11-27 20:30:49,341 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:49,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 516 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 485 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2024-11-27 20:30:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-27 20:30:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-27 20:30:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:30:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2024-11-27 20:30:49,355 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 38 [2024-11-27 20:30:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:49,355 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-11-27 20:30:49,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 23 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:30:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-11-27 20:30:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 20:30:49,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:49,356 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:49,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:30:49,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:49,557 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:30:49,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash -388864176, now seen corresponding path program 2 times [2024-11-27 20:30:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:49,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593525997] [2024-11-27 20:30:49,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:30:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:49,607 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:30:49,607 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:30:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:30:49,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:49,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593525997] [2024-11-27 20:30:49,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593525997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:30:49,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:30:49,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:30:49,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254839746] [2024-11-27 20:30:49,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:30:49,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:30:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:49,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:30:49,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:30:49,774 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 20:30:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:49,839 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2024-11-27 20:30:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:30:49,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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) Word has length 40 [2024-11-27 20:30:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:49,841 INFO L225 Difference]: With dead ends: 64 [2024-11-27 20:30:49,841 INFO L226 Difference]: Without dead ends: 45 [2024-11-27 20:30:49,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:30:49,842 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:49,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 99 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:30:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-27 20:30:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-11-27 20:30:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:30:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-27 20:30:49,889 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 40 [2024-11-27 20:30:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:49,890 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-27 20:30:49,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 20:30:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-27 20:30:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-27 20:30:49,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:49,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:49,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:30:49,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:30:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash 808980886, now seen corresponding path program 1 times [2024-11-27 20:30:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:49,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103644451] [2024-11-27 20:30:49,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 20:30:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103644451] [2024-11-27 20:30:50,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103644451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30754890] [2024-11-27 20:30:50,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:50,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:30:50,349 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:30:50,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:30:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:50,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 20:30:50,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:30:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:30:50,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:30:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:30:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30754890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:30:50,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:30:50,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2024-11-27 20:30:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821364993] [2024-11-27 20:30:50,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:30:50,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-27 20:30:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:50,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-27 20:30:50,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-27 20:30:50,833 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 20:30:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:51,054 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-27 20:30:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:30:51,055 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2024-11-27 20:30:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:51,055 INFO L225 Difference]: With dead ends: 54 [2024-11-27 20:30:51,056 INFO L226 Difference]: Without dead ends: 43 [2024-11-27 20:30:51,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-11-27 20:30:51,057 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:51,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 186 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:30:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-27 20:30:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-27 20:30:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:30:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-11-27 20:30:51,076 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 41 [2024-11-27 20:30:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:51,077 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-27 20:30:51,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 20:30:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-11-27 20:30:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-27 20:30:51,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:51,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:51,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:30:51,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:51,282 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:30:51,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash 809049396, now seen corresponding path program 1 times [2024-11-27 20:30:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545047987] [2024-11-27 20:30:51,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:30:53,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545047987] [2024-11-27 20:30:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545047987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55205228] [2024-11-27 20:30:53,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:53,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:30:53,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:30:53,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:30:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:53,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-27 20:30:53,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:30:53,625 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 20:30:53,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:30:54,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:30:54,146 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-27 20:30:54,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-27 20:30:54,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 20:30:54,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:30:54,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:30:54,675 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-27 20:30:54,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2024-11-27 20:30:54,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-27 20:30:54,691 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 55 treesize of output 19 [2024-11-27 20:30:54,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-27 20:30:54,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-27 20:30:54,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 20:30:54,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:30:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:30:54,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:30:55,126 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1017 Int)) (= (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1017)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1015) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1016) .cse0) .cse1))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2024-11-27 20:30:55,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:30:55,141 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 77 treesize of output 78 [2024-11-27 20:30:55,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:30:55,163 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 150 treesize of output 149 [2024-11-27 20:30:55,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:30:55,177 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 126 treesize of output 116 [2024-11-27 20:30:55,189 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 56 treesize of output 48 [2024-11-27 20:30:55,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:30:55,209 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 200 treesize of output 185 [2024-11-27 20:30:55,221 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 39 treesize of output 31 [2024-11-27 20:30:57,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse10)) (.cse5 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse2 (and (or (forall ((v_ArrVal_1013 (Array Int Int)) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| .cse6 v_ArrVal_1013) v_arrayElimCell_45) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) .cse7) (or (forall ((v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1017 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (= (select (select (let ((.cse13 (store |c_#memory_int#2| .cse6 v_ArrVal_1013))) (store .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1017))) v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse7) (forall ((v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1017 Int) (v_arrayElimCell_45 Int)) (let ((.cse14 (store |c_#memory_int#2| .cse6 v_ArrVal_1013))) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1017)) v_arrayElimCell_46) v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_45) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))))) (forall ((v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1017 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (let ((.cse15 (let ((.cse16 (store |c_#memory_int#2| .cse6 v_ArrVal_1013))) (store .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1017))))) (or (= (select (select .cse15 v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_46) v_arrayElimCell_49)))))))) (.cse0 (and (or (forall ((v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1017 Int) (v_arrayElimCell_48 Int)) (= (select (store (select (store |c_#memory_int#2| .cse6 v_ArrVal_1013) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1017) v_arrayElimCell_48) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse7) (forall ((v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1017 Int) (v_arrayElimCell_48 Int)) (let ((.cse12 (store |c_#memory_int#2| .cse6 v_ArrVal_1013))) (let ((.cse11 (store (select .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1017))) (or (= (select .cse11 v_arrayElimCell_48) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse11) v_arrayElimCell_46) v_arrayElimCell_49))))))))) (.cse8 (= .cse10 .cse6))) (and (or .cse0 .cse1) (or .cse2 .cse1) (forall ((v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1017 Int)) (let ((.cse4 (store |c_#memory_int#2| .cse6 v_ArrVal_1013))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|))) (or (= (select .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store .cse3 .cse5 v_ArrVal_1017)) v_arrayElimCell_46) v_arrayElimCell_49))))))) (or .cse7 (forall ((v_ArrVal_1013 (Array Int Int))) (= (select (select (store |c_#memory_int#2| .cse6 v_ArrVal_1013) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|))) (or .cse2 .cse8) (or .cse0 .cse8) (or (forall ((v_ArrVal_1013 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1017 Int) (v_arrayElimCell_49 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse9 (store |c_#memory_int#2| .cse6 v_ArrVal_1013))) (store .cse9 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1017))) v_arrayElimCell_46) v_arrayElimCell_49))) (not .cse7)))))) is different from false [2024-11-27 20:31:02,933 INFO L349 Elim1Store]: treesize reduction 180, result has 84.1 percent of original size [2024-11-27 20:31:02,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 2427 treesize of output 2918 [2024-11-27 20:31:03,585 INFO L224 Elim1Store]: Index analysis took 174 ms [2024-11-27 20:31:06,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:31:06,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2124 treesize of output 3118 [2024-11-27 20:31:07,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:31:07,136 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 1871 treesize of output 1868 [2024-11-27 20:31:07,751 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 1859 treesize of output 1857 [2024-11-27 20:31:08,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:31:08,455 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 1877 treesize of output 1878 [2024-11-27 20:31:09,249 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 1889 treesize of output 1883 [2024-11-27 20:31:09,921 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 1903 treesize of output 1897 [2024-11-27 20:31:10,776 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 1897 treesize of output 1895 [2024-11-27 20:31:11,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:31:11,588 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 1925 treesize of output 1926 [2024-11-27 20:31:12,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:31:12,385 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 1937 treesize of output 1938 [2024-11-27 20:31:13,153 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 1939 treesize of output 1937 [2024-11-27 20:31:13,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:31:13,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1967 treesize of output 1968 [2024-11-27 20:31:14,532 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 1969 treesize of output 1967 [2024-11-27 20:31:15,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:31:15,349 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 2007 treesize of output 2004 [2024-11-27 20:31:16,134 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 1995 treesize of output 1993 [2024-11-27 20:31:16,827 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 2013 treesize of output 2007 [2024-11-27 20:31:17,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:31:17,632 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 2027 treesize of output 2028 [2024-11-27 20:39:46,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-27 20:39:46,731 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-27 20:39:46,733 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-27 20:39:46,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 20:39:46,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-27 20:39:46,937 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:584) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:177) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 75 more [2024-11-27 20:39:46,945 INFO L158 Benchmark]: Toolchain (without parser) took 590657.00ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 118.7MB in the beginning and 765.0MB in the end (delta: -646.3MB). Peak memory consumption was 905.5MB. Max. memory is 16.1GB. [2024-11-27 20:39:46,945 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 142.6MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:39:46,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.17ms. Allocated memory is still 142.6MB. Free memory was 118.5MB in the beginning and 100.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:39:46,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.10ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:39:46,946 INFO L158 Benchmark]: Boogie Preprocessor took 72.33ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:39:46,946 INFO L158 Benchmark]: RCFGBuilder took 716.38ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 78.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:39:46,947 INFO L158 Benchmark]: TraceAbstraction took 589173.55ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 77.6MB in the beginning and 765.0MB in the end (delta: -687.4MB). Peak memory consumption was 863.6MB. Max. memory is 16.1GB. [2024-11-27 20:39:46,949 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.44ms. Allocated memory is still 142.6MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.17ms. Allocated memory is still 142.6MB. Free memory was 118.5MB in the beginning and 100.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.10ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.33ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 716.38ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 78.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 589173.55ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 77.6MB in the beginning and 765.0MB in the end (delta: -687.4MB). Peak memory consumption was 863.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/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_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:39:49,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:39:50,149 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 20:39:50,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:39:50,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:39:50,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:39:50,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:39:50,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:39:50,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:39:50,210 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:39:50,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:39:50,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:39:50,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:39:50,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:39:50,212 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:39:50,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:39:50,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:39:50,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:39:50,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:39:50,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:39:50,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:39:50,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:39:50,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:39:50,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:39:50,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:39:50,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:39:50,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:39:50,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:39:50,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:39:50,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:39:50,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:39:50,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:39:50,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:39:50,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:39:50,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:39:50,216 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:39:50,216 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:39:50,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:39:50,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:39:50,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:39:50,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:39:50,216 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_56748ffb-4f0b-442a-9723-43d1552c74c9/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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2024-11-27 20:39:50,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:39:50,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:39:50,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:39:50,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:39:50,657 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:39:50,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-11-27 20:39:54,498 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data/60cc5a90c/a060926b65c4462292899eaf441a8da5/FLAG3b340c5f8 [2024-11-27 20:39:54,893 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:39:54,893 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-11-27 20:39:54,910 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data/60cc5a90c/a060926b65c4462292899eaf441a8da5/FLAG3b340c5f8 [2024-11-27 20:39:54,930 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/data/60cc5a90c/a060926b65c4462292899eaf441a8da5 [2024-11-27 20:39:54,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:39:54,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:39:54,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:39:54,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:39:54,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:39:54,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:39:54" (1/1) ... [2024-11-27 20:39:54,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c4ebd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:54, skipping insertion in model container [2024-11-27 20:39:54,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:39:54" (1/1) ... [2024-11-27 20:39:54,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:39:55,372 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_56748ffb-4f0b-442a-9723-43d1552c74c9/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2024-11-27 20:39:55,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:39:55,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:39:55,508 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_56748ffb-4f0b-442a-9723-43d1552c74c9/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2024-11-27 20:39:55,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:39:55,551 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:39:55,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55 WrapperNode [2024-11-27 20:39:55,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:39:55,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:39:55,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:39:55,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:39:55,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,609 INFO L138 Inliner]: procedures = 131, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2024-11-27 20:39:55,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:39:55,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:39:55,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:39:55,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:39:55,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,651 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-11-27 20:39:55,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,670 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:39:55,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:39:55,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:39:55,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:39:55,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (1/1) ... [2024-11-27 20:39:55,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:39:55,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:39:55,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:39:55,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:39:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 20:39:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 20:39:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 20:39:55,807 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-27 20:39:55,807 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-27 20:39:55,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:39:55,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:39:55,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:39:55,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:39:55,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:39:55,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:39:55,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:39:55,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:39:55,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:39:55,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:39:55,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 20:39:55,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 20:39:55,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 20:39:55,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 20:39:55,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 20:39:55,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 20:39:55,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:39:55,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:39:55,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 20:39:55,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:39:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:39:56,075 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:39:56,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:39:56,561 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-27 20:39:56,561 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:39:56,572 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:39:56,573 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-27 20:39:56,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:39:56 BoogieIcfgContainer [2024-11-27 20:39:56,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:39:56,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:39:56,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:39:56,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:39:56,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:39:54" (1/3) ... [2024-11-27 20:39:56,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7608424f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:39:56, skipping insertion in model container [2024-11-27 20:39:56,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:39:55" (2/3) ... [2024-11-27 20:39:56,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7608424f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:39:56, skipping insertion in model container [2024-11-27 20:39:56,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:39:56" (3/3) ... [2024-11-27 20:39:56,586 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2024-11-27 20:39:56,603 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:39:56,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_unequal.i that has 2 procedures, 37 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-27 20:39:56,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:39:56,680 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;@be50de5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:39:56,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:39:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 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 20:39:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 20:39:56,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:39:56,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:39:56,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:39:56,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:39:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash 134853294, now seen corresponding path program 1 times [2024-11-27 20:39:56,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:39:56,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890399301] [2024-11-27 20:39:56,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:39:56,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:56,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:39:56,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:39:56,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:39:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:39:56,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:39:56,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:39:57,011 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 20:39:57,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:39:57,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:39:57,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890399301] [2024-11-27 20:39:57,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890399301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:39:57,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:39:57,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:39:57,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749811748] [2024-11-27 20:39:57,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:39:57,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:39:57,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:39:57,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:39:57,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:39:57,054 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 20:39:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:39:57,081 INFO L93 Difference]: Finished difference Result 69 states and 98 transitions. [2024-11-27 20:39:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:39:57,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 20 [2024-11-27 20:39:57,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:39:57,091 INFO L225 Difference]: With dead ends: 69 [2024-11-27 20:39:57,092 INFO L226 Difference]: Without dead ends: 30 [2024-11-27 20:39:57,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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 20:39:57,101 INFO L435 NwaCegarLoop]: 47 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, 47 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 20:39:57,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:39:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-27 20:39:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-27 20:39:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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 20:39:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-27 20:39:57,150 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 20 [2024-11-27 20:39:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:39:57,152 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-27 20:39:57,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 20:39:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-27 20:39:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 20:39:57,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:39:57,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:39:57,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:39:57,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:57,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:39:57,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:39:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1753546546, now seen corresponding path program 1 times [2024-11-27 20:39:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:39:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496691799] [2024-11-27 20:39:57,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:39:57,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:57,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:39:57,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:39:57,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:39:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:39:57,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:39:57,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:39:57,713 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 20:39:57,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:39:57,714 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:39:57,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496691799] [2024-11-27 20:39:57,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496691799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:39:57,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:39:57,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:39:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912786215] [2024-11-27 20:39:57,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:39:57,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:39:57,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:39:57,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:39:57,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:39:57,720 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20:39:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:39:57,783 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2024-11-27 20:39:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:39:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2024-11-27 20:39:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:39:57,785 INFO L225 Difference]: With dead ends: 46 [2024-11-27 20:39:57,786 INFO L226 Difference]: Without dead ends: 33 [2024-11-27 20:39:57,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 20:39:57,788 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 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.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:39:57,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:39:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-27 20:39:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-27 20:39:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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 20:39:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-11-27 20:39:57,798 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 20 [2024-11-27 20:39:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:39:57,798 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-11-27 20:39:57,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20:39:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-11-27 20:39:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 20:39:57,799 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:39:57,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:39:57,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:39:57,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:58,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:39:58,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:39:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash -766413388, now seen corresponding path program 1 times [2024-11-27 20:39:58,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:39:58,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545934396] [2024-11-27 20:39:58,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:39:58,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:58,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:39:58,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:39:58,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:39:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:39:58,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:39:58,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:39:58,236 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 20:39:58,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:39:58,236 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:39:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545934396] [2024-11-27 20:39:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545934396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:39:58,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:39:58,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:39:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061118452] [2024-11-27 20:39:58,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:39:58,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:39:58,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:39:58,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:39:58,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:39:58,240 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20:39:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:39:58,287 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2024-11-27 20:39:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:39:58,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2024-11-27 20:39:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:39:58,289 INFO L225 Difference]: With dead ends: 62 [2024-11-27 20:39:58,290 INFO L226 Difference]: Without dead ends: 35 [2024-11-27 20:39:58,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 20:39:58,292 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 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 20:39:58,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:39:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-27 20:39:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-27 20:39:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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 20:39:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-27 20:39:58,305 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 20 [2024-11-27 20:39:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:39:58,305 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-27 20:39:58,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20:39:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-27 20:39:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-27 20:39:58,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:39:58,307 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] [2024-11-27 20:39:58,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 20:39:58,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:58,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:39:58,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:39:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 767743583, now seen corresponding path program 1 times [2024-11-27 20:39:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:39:58,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967008283] [2024-11-27 20:39:58,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:39:58,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:58,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:39:58,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:39:58,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:39:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:39:58,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:39:58,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:39:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:39:58,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:39:58,910 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 20:39:58,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:39:58,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967008283] [2024-11-27 20:39:58,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967008283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:39:58,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:39:58,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-27 20:39:58,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032991301] [2024-11-27 20:39:58,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:39:58,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:39:58,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:39:58,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:39:58,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:39:58,916 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-27 20:39:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:39:59,088 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2024-11-27 20:39:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:39:59,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-27 20:39:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:39:59,090 INFO L225 Difference]: With dead ends: 69 [2024-11-27 20:39:59,090 INFO L226 Difference]: Without dead ends: 42 [2024-11-27 20:39:59,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:39:59,092 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:39:59,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 169 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:39:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-27 20:39:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-27 20:39:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:39:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2024-11-27 20:39:59,102 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 28 [2024-11-27 20:39:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:39:59,102 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2024-11-27 20:39:59,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-27 20:39:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2024-11-27 20:39:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-27 20:39:59,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:39:59,104 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:39:59,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 20:39:59,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:59,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:39:59,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:39:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash 998923274, now seen corresponding path program 2 times [2024-11-27 20:39:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:39:59,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805976947] [2024-11-27 20:39:59,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:39:59,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:59,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:39:59,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:39:59,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:39:59,493 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:39:59,493 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:39:59,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:39:59,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:39:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:39:59,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:39:59,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:39:59,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805976947] [2024-11-27 20:39:59,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805976947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:39:59,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:39:59,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:39:59,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094281125] [2024-11-27 20:39:59,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:39:59,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:39:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:39:59,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:39:59,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:39:59,578 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20:39:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:39:59,647 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2024-11-27 20:39:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:39:59,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 36 [2024-11-27 20:39:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:39:59,649 INFO L225 Difference]: With dead ends: 58 [2024-11-27 20:39:59,649 INFO L226 Difference]: Without dead ends: 44 [2024-11-27 20:39:59,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:39:59,650 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:39:59,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:39:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-27 20:39:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-11-27 20:39:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:39:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-11-27 20:39:59,668 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 36 [2024-11-27 20:39:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:39:59,668 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-27 20:39:59,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20:39:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-11-27 20:39:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:39:59,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:39:59,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:39:59,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 20:39:59,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:59,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:39:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:39:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash -847115540, now seen corresponding path program 1 times [2024-11-27 20:39:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:39:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542714004] [2024-11-27 20:39:59,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:39:59,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:39:59,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:39:59,878 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:39:59,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:40:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:00,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-27 20:40:00,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:40:00,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:40:00,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:40:00,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:40:00,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-27 20:40:01,113 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:40:01,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-27 20:40:01,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 20:40:01,708 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 39 treesize of output 15 [2024-11-27 20:40:01,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 20:40:01,978 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 19 treesize of output 11 [2024-11-27 20:40:02,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:40:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:40:02,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:40:02,320 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_253) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-11-27 20:40:02,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_253) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_252 .cse0))) v_ArrVal_252)))) is different from false [2024-11-27 20:40:02,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_253) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_252 (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_252 .cse0))))))) is different from false [2024-11-27 20:40:02,480 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= v_ArrVal_252 (let ((.cse1 (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_252 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_252) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_253) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-27 20:40:02,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_257 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| (_ BitVec 32)) (v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14|))) (not (= v_ArrVal_252 (let ((.cse1 (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_257) .cse0) .cse1 (select v_ArrVal_252 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_252) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_253) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-27 20:40:02,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:40:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542714004] [2024-11-27 20:40:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542714004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:40:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1955467053] [2024-11-27 20:40:02,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:40:02,606 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:40:02,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:40:02,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:40:02,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-27 20:40:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:03,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-27 20:40:03,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:40:03,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:40:03,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:40:03,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:40:03,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-27 20:40:03,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-27 20:40:08,482 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 20:40:08,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-27 20:40:08,539 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:40:08,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-27 20:40:09,376 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 39 treesize of output 15 [2024-11-27 20:40:09,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 20:40:09,788 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 19 treesize of output 11 [2024-11-27 20:40:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:40:10,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:40:10,050 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_327) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-27 20:40:10,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_327) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_326 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_326 .cse0))))))) is different from false [2024-11-27 20:40:10,137 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_326 (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_326 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_327) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2024-11-27 20:40:10,207 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_326) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_327) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_326 (let ((.cse1 (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_326 .cse1)))))))) is different from false [2024-11-27 20:40:10,332 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_18| (_ BitVec 32)) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_18|))) (= (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_326) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_18| v_ArrVal_327) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_326 (let ((.cse1 (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_18| v_ArrVal_331) .cse0) .cse1 (select v_ArrVal_326 .cse1)))))))) is different from false [2024-11-27 20:40:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1955467053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:40:10,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:40:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2024-11-27 20:40:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296804553] [2024-11-27 20:40:10,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:40:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-27 20:40:10,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:40:10,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-27 20:40:10,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1150, Unknown=11, NotChecked=770, Total=2070 [2024-11-27 20:40:10,346 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 34 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:40:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:40:13,248 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2024-11-27 20:40:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-27 20:40:13,249 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2024-11-27 20:40:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:40:13,251 INFO L225 Difference]: With dead ends: 72 [2024-11-27 20:40:13,251 INFO L226 Difference]: Without dead ends: 70 [2024-11-27 20:40:13,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=182, Invalid=1653, Unknown=11, NotChecked=910, Total=2756 [2024-11-27 20:40:13,255 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:40:13,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 369 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-27 20:40:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-27 20:40:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2024-11-27 20:40:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:40:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2024-11-27 20:40:13,273 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 38 [2024-11-27 20:40:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:40:13,274 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2024-11-27 20:40:13,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:40:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2024-11-27 20:40:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:40:13,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:40:13,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:40:13,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-27 20:40:13,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:40:13,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:13,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:40:13,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:40:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash -847047030, now seen corresponding path program 1 times [2024-11-27 20:40:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:40:13,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [773882856] [2024-11-27 20:40:13,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:40:13,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:13,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:40:13,683 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:40:13,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:40:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:13,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 20:40:13,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:40:14,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-27 20:40:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:40:14,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:40:14,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-27 20:40:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-27 20:40:14,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:40:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773882856] [2024-11-27 20:40:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773882856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:40:14,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:40:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2024-11-27 20:40:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591556175] [2024-11-27 20:40:14,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:40:14,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 20:40:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:40:14,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 20:40:14,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-27 20:40:14,760 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:40:19,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:40:23,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:40:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:40:23,970 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2024-11-27 20:40:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 20:40:23,974 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2024-11-27 20:40:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:40:23,975 INFO L225 Difference]: With dead ends: 83 [2024-11-27 20:40:23,976 INFO L226 Difference]: Without dead ends: 75 [2024-11-27 20:40:23,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2024-11-27 20:40:23,977 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 64 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:40:23,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 390 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-27 20:40:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-27 20:40:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2024-11-27 20:40:23,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:40:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-11-27 20:40:23,994 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 38 [2024-11-27 20:40:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:40:23,995 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-11-27 20:40:23,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-27 20:40:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2024-11-27 20:40:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:40:23,996 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:40:23,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:40:24,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-27 20:40:24,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:24,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:40:24,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:40:24,198 INFO L85 PathProgramCache]: Analyzing trace with hash 927891822, now seen corresponding path program 1 times [2024-11-27 20:40:24,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:40:24,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432166797] [2024-11-27 20:40:24,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:40:24,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:24,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:40:24,203 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:40:24,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:40:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-27 20:40:24,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:40:24,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-27 20:40:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:40:24,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:40:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-27 20:40:24,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:40:24,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432166797] [2024-11-27 20:40:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432166797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:40:24,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:40:24,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11 [2024-11-27 20:40:24,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084262373] [2024-11-27 20:40:24,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:40:24,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:40:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:40:24,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:40:24,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:40:24,782 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 20:40:28,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:40:33,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:40:33,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:40:33,903 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2024-11-27 20:40:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:40:33,904 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-27 20:40:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:40:33,905 INFO L225 Difference]: With dead ends: 82 [2024-11-27 20:40:33,907 INFO L226 Difference]: Without dead ends: 69 [2024-11-27 20:40:33,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-27 20:40:33,909 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 42 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:40:33,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 379 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-11-27 20:40:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-27 20:40:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2024-11-27 20:40:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:40:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2024-11-27 20:40:33,936 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 38 [2024-11-27 20:40:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:40:33,936 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-11-27 20:40:33,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 20:40:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2024-11-27 20:40:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 20:40:33,937 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:40:33,937 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:40:33,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 20:40:34,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:34,142 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:40:34,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:40:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash -388864176, now seen corresponding path program 2 times [2024-11-27 20:40:34,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:40:34,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507579128] [2024-11-27 20:40:34,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:40:34,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:34,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:40:34,146 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:40:34,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:40:34,421 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:40:34,421 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:40:34,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:40:34,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:40:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:40:34,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:40:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:40:34,656 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:40:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507579128] [2024-11-27 20:40:34,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507579128] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:40:34,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:40:34,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-27 20:40:34,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39036615] [2024-11-27 20:40:34,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:40:34,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:40:34,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:40:34,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:40:34,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:40:34,658 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 20:40:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:40:34,728 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2024-11-27 20:40:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:40:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2024-11-27 20:40:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:40:34,729 INFO L225 Difference]: With dead ends: 70 [2024-11-27 20:40:34,729 INFO L226 Difference]: Without dead ends: 51 [2024-11-27 20:40:34,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:40:34,730 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:40:34,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 99 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:40:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-27 20:40:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-27 20:40:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:40:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-11-27 20:40:34,749 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 40 [2024-11-27 20:40:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:40:34,750 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-11-27 20:40:34,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 20:40:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-27 20:40:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-27 20:40:34,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:40:34,751 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:40:34,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:40:34,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:34,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:40:34,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:40:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash 808980886, now seen corresponding path program 1 times [2024-11-27 20:40:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:40:34,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854465776] [2024-11-27 20:40:34,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:40:34,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:34,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:40:34,955 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:40:34,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:40:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:35,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:40:35,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:40:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:40:35,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:40:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 20:40:35,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:40:35,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854465776] [2024-11-27 20:40:35,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854465776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:40:35,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:40:35,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-27 20:40:35,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802932611] [2024-11-27 20:40:35,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:40:35,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:40:35,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:40:35,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:40:35,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:40:35,509 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 20:40:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:40:35,696 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-11-27 20:40:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:40:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2024-11-27 20:40:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:40:35,698 INFO L225 Difference]: With dead ends: 60 [2024-11-27 20:40:35,698 INFO L226 Difference]: Without dead ends: 49 [2024-11-27 20:40:35,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:40:35,699 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:40:35,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:40:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-27 20:40:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-27 20:40:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:40:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-11-27 20:40:35,725 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 41 [2024-11-27 20:40:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:40:35,725 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-11-27 20:40:35,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 20:40:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-11-27 20:40:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-27 20:40:35,727 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:40:35,727 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:40:35,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-27 20:40:35,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:35,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:40:35,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:40:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash 809049396, now seen corresponding path program 1 times [2024-11-27 20:40:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:40:35,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234037047] [2024-11-27 20:40:35,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:40:35,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:35,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:40:35,933 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:40:35,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56748ffb-4f0b-442a-9723-43d1552c74c9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:40:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:36,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-27 20:40:36,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:40:36,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:40:36,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-27 20:40:36,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:40:36,611 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:40:36,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-27 20:40:37,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 20:40:37,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:40:37,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:40:37,359 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-27 20:40:37,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2024-11-27 20:40:37,367 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 55 treesize of output 19 [2024-11-27 20:40:37,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-27 20:40:37,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-27 20:40:37,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-27 20:40:37,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 20:40:37,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:40:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:40:37,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:40:38,308 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_649 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_647 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_647 .cse0))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_649) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_648) .cse1) .cse2)))))) is different from false [2024-11-27 20:40:38,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:40:38,338 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 67 treesize of output 68 [2024-11-27 20:40:38,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:40:38,398 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 130 treesize of output 129 [2024-11-27 20:40:38,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:40:38,419 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 106 treesize of output 96 [2024-11-27 20:40:38,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:40:38,469 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 176 treesize of output 161 [2024-11-27 20:40:38,488 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 37 treesize of output 29 [2024-11-27 20:40:38,503 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 29 treesize of output 21 [2024-11-27 20:40:39,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (= .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (let ((.cse9 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_37) v_arrayElimCell_38)) (not (= v_ArrVal_647 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1))))))) (.cse7 (not .cse3))) (let ((.cse5 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_37) v_arrayElimCell_38))) (not (= v_ArrVal_647 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1)))) (= (select v_ArrVal_647 v_arrayElimCell_35) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse13 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|)) (.cse8 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_37) v_arrayElimCell_38))) (= (select (select .cse19 v_arrayElimCell_34) v_arrayElimCell_35) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_647 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1))))))))) (.cse4 (or .cse9 .cse7)) (.cse10 (forall ((v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_37) v_arrayElimCell_38))) (not (= v_ArrVal_647 (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_34) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (.cse11 (or .cse3 (forall ((v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644))) (or (not (= v_ArrVal_647 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_34) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (.cse12 (or .cse3 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644))) (or (= (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_34) v_arrayElimCell_35) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_647 (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1))))))))) (.cse2 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse14))) (and (forall ((v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_37) v_arrayElimCell_38))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_647 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_647 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1))))))) (or .cse2 (and (or .cse3 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_3) v_arrayElimCell_35) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse4 .cse5)) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_37) v_arrayElimCell_38)) (not (= v_ArrVal_647 (store (select .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1))))))) .cse7) (or (and .cse8 (or .cse2 .cse9 .cse7) .cse10 .cse11 .cse12) .cse13) (or (and .cse5 (or .cse3 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_2) v_arrayElimCell_35))))) .cse13) (or .cse3 (forall ((v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (or (and .cse8 .cse4 .cse10 .cse11 .cse12) .cse2)))))) is different from false [2024-11-27 20:40:44,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (= .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (let ((.cse13 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_37) v_arrayElimCell_38)) (not (= v_ArrVal_647 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1))))))) (.cse7 (not .cse3))) (let ((.cse2 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_37) v_arrayElimCell_38))) (not (= v_ArrVal_647 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1)))) (= (select v_ArrVal_647 v_arrayElimCell_35) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse4 (or .cse13 .cse7)) (.cse8 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse9 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647))) (or (= (select (select .cse19 v_arrayElimCell_34) v_arrayElimCell_35) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_37) v_arrayElimCell_38))) (not (= v_ArrVal_647 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1))))))))) (.cse5 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse18)) (.cse10 (forall ((v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 v_arrayElimCell_37) v_arrayElimCell_38))) (not (= v_ArrVal_647 (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse16 v_arrayElimCell_34) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (.cse11 (or .cse3 (forall ((v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644))) (or (not (= v_ArrVal_647 (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_34) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (.cse12 (or .cse3 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644))) (or (= (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_34) v_arrayElimCell_35) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_647 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1)))))))))) (and (forall ((v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_647 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_37) v_arrayElimCell_38))) (not (= v_ArrVal_647 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1))))))) (or (and .cse2 (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_3) v_arrayElimCell_35))) .cse3) .cse4) .cse5) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_647) v_arrayElimCell_37) v_arrayElimCell_38)) (not (= v_ArrVal_647 (store (select .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_647 .cse1))))))) .cse7) (or (forall ((v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse3) (or (and (or .cse3 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_2) v_arrayElimCell_35) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse2) .cse8) (or .cse5 (and .cse9 .cse10 .cse11 .cse12 .cse4)) (or .cse8 (and .cse9 (or .cse13 .cse5 .cse7) .cse10 .cse11 .cse12))))))) is different from false