./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya --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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:07:57,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:07:57,521 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:07:57,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:07:57,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:07:57,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:07:57,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:07:57,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:07:57,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:07:57,551 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:07:57,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:07:57,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:07:57,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:07:57,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:07:57,554 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:07:57,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:07:57,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:07:57,555 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:07:57,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:07:57,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:07:57,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:07:57,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:07:57,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:07:57,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:07:57,559 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:07:57,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:07:57,559 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:07:57,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:07:57,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:07:57,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:07:57,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:07:57,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:07:57,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:07:57,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:07:57,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:07:57,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:07:57,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:07:57,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:07:57,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:07:57,563 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:07:57,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:07:57,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:07:57,564 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-11-29 04:07:57,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:07:57,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:07:57,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:07:57,794 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:07:57,795 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:07:57,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-29 04:08:00,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:08:00,764 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:08:00,764 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-29 04:08:00,778 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/data/c9a14a274/cc10b7a1278a4146934cfaf9e73683d0/FLAGc4efa44e6 [2023-11-29 04:08:00,791 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/data/c9a14a274/cc10b7a1278a4146934cfaf9e73683d0 [2023-11-29 04:08:00,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:08:00,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:08:00,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:08:00,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:08:00,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:08:00,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:08:00" (1/1) ... [2023-11-29 04:08:00,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a73d06f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:00, skipping insertion in model container [2023-11-29 04:08:00,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:08:00" (1/1) ... [2023-11-29 04:08:00,850 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:08:01,139 WARN L240 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_cc6583f5-bbd0-4896-824f-7013b52c654b/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-29 04:08:01,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:08:01,156 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:08:01,199 WARN L240 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_cc6583f5-bbd0-4896-824f-7013b52c654b/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-29 04:08:01,200 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:08:01,234 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:08:01,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01 WrapperNode [2023-11-29 04:08:01,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:08:01,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:08:01,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:08:01,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:08:01,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,286 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 174 [2023-11-29 04:08:01,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:08:01,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:08:01,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:08:01,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:08:01,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,331 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2023-11-29 04:08:01,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:08:01,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:08:01,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:08:01,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:08:01,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (1/1) ... [2023-11-29 04:08:01,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:08:01,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:01,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:08:01,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:08:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:08:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:08:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:08:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:08:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:08:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:08:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 04:08:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 04:08:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:08:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:08:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:08:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:08:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:08:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:08:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:08:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:08:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:08:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:08:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:08:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:08:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:08:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:08:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:08:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:08:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:08:01,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:08:01,598 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:08:01,600 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:08:01,839 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:08:01,880 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:08:01,880 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 04:08:01,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:08:01 BoogieIcfgContainer [2023-11-29 04:08:01,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:08:01,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:08:01,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:08:01,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:08:01,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:08:00" (1/3) ... [2023-11-29 04:08:01,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b62aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:08:01, skipping insertion in model container [2023-11-29 04:08:01,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:01" (2/3) ... [2023-11-29 04:08:01,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b62aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:08:01, skipping insertion in model container [2023-11-29 04:08:01,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:08:01" (3/3) ... [2023-11-29 04:08:01,889 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-11-29 04:08:01,904 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:08:01,904 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:08:01,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:08:01,950 INFO L357 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, mHoare=true, 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;@219f7054, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:08:01,950 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:08:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 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) [2023-11-29 04:08:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:08:01,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:01,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:01,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:01,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash -143673426, now seen corresponding path program 1 times [2023-11-29 04:08:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:01,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368520753] [2023-11-29 04:08:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:08:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:08:02,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:02,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368520753] [2023-11-29 04:08:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368520753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:08:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346545255] [2023-11-29 04:08:02,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:02,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:02,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:02,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:02,316 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 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) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-29 04:08:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:02,391 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2023-11-29 04:08:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:02,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2023-11-29 04:08:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:02,399 INFO L225 Difference]: With dead ends: 64 [2023-11-29 04:08:02,400 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 04:08:02,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:02,405 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:02,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:08:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 04:08:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 04:08:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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) [2023-11-29 04:08:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-11-29 04:08:02,438 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 19 [2023-11-29 04:08:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:02,439 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-11-29 04:08:02,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-29 04:08:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-11-29 04:08:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:08:02,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:02,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:02,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:08:02,442 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:02,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1502228012, now seen corresponding path program 1 times [2023-11-29 04:08:02,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:02,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449238529] [2023-11-29 04:08:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:08:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:08:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:02,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449238529] [2023-11-29 04:08:02,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449238529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:02,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:02,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:08:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312257357] [2023-11-29 04:08:02,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:02,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:08:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:08:02,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:08:02,647 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-11-29 04:08:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:02,706 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2023-11-29 04:08:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:08:02,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2023-11-29 04:08:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:02,708 INFO L225 Difference]: With dead ends: 53 [2023-11-29 04:08:02,708 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 04:08:02,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:08:02,710 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:02,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:08:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 04:08:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-29 04:08:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 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) [2023-11-29 04:08:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2023-11-29 04:08:02,718 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2023-11-29 04:08:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:02,719 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2023-11-29 04:08:02,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-11-29 04:08:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2023-11-29 04:08:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:08:02,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:02,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:02,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:08:02,721 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:02,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1969454644, now seen corresponding path program 1 times [2023-11-29 04:08:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:02,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886724077] [2023-11-29 04:08:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:02,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:08:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:08:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:08:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886724077] [2023-11-29 04:08:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886724077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:02,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:02,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:08:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794895043] [2023-11-29 04:08:02,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:02,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:08:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:02,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:08:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:08:02,848 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:08:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:02,905 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2023-11-29 04:08:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:08:02,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 04:08:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:02,907 INFO L225 Difference]: With dead ends: 44 [2023-11-29 04:08:02,907 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 04:08:02,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:08:02,909 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:02,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:08:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 04:08:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-29 04:08:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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) [2023-11-29 04:08:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2023-11-29 04:08:02,916 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 25 [2023-11-29 04:08:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:02,916 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2023-11-29 04:08:02,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:08:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2023-11-29 04:08:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 04:08:02,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:02,918 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:02,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:08:02,918 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:02,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1835723964, now seen corresponding path program 1 times [2023-11-29 04:08:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:02,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692563654] [2023-11-29 04:08:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:02,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:04,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:08:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:04,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:08:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:08:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:04,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692563654] [2023-11-29 04:08:04,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692563654] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:08:04,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5997317] [2023-11-29 04:08:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:04,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:04,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:04,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:08:04,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:08:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:04,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 101 conjunts are in the unsatisfiable core [2023-11-29 04:08:04,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:05,062 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 [2023-11-29 04:08:05,321 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 [2023-11-29 04:08:05,406 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:08:05,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:08:05,494 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 [2023-11-29 04:08:05,620 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 [2023-11-29 04:08:05,735 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 [2023-11-29 04:08:05,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:08:05,984 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 04:08:05,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 04:08:06,002 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 [2023-11-29 04:08:06,362 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-29 04:08:06,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:08:06,447 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 [2023-11-29 04:08:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:06,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:08:07,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5997317] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:08:07,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:08:07,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2023-11-29 04:08:07,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050500497] [2023-11-29 04:08:07,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:08:07,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 04:08:07,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:07,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 04:08:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1981, Unknown=23, NotChecked=0, Total=2162 [2023-11-29 04:08:07,091 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:08:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:08,391 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2023-11-29 04:08:08,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 04:08:08,391 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-29 04:08:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:08,393 INFO L225 Difference]: With dead ends: 58 [2023-11-29 04:08:08,393 INFO L226 Difference]: Without dead ends: 56 [2023-11-29 04:08:08,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=289, Invalid=3348, Unknown=23, NotChecked=0, Total=3660 [2023-11-29 04:08:08,396 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 68 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:08,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 413 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:08:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-29 04:08:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2023-11-29 04:08:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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) [2023-11-29 04:08:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-11-29 04:08:08,406 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 26 [2023-11-29 04:08:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:08,406 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-29 04:08:08,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:08:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2023-11-29 04:08:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 04:08:08,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:08,408 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:08,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:08:08,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:08,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:08,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash 462823476, now seen corresponding path program 2 times [2023-11-29 04:08:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:08,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588540328] [2023-11-29 04:08:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:08,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:08:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:08,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:08:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:08:08,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:08,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588540328] [2023-11-29 04:08:08,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588540328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:08,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:08,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:08:08,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664323443] [2023-11-29 04:08:08,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:08,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:08:08,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:08,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:08:08,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:08:08,780 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:08:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:08,843 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2023-11-29 04:08:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:08:08,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-29 04:08:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:08,845 INFO L225 Difference]: With dead ends: 53 [2023-11-29 04:08:08,845 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 04:08:08,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:08:08,846 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:08,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 72 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:08:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 04:08:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 04:08:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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) [2023-11-29 04:08:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-11-29 04:08:08,855 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 27 [2023-11-29 04:08:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:08,855 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-11-29 04:08:08,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:08:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-11-29 04:08:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 04:08:08,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:08,857 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:08,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:08:08,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:08,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash 162755610, now seen corresponding path program 1 times [2023-11-29 04:08:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951852184] [2023-11-29 04:08:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:08,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:08:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:08:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:08:08,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951852184] [2023-11-29 04:08:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951852184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:08,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:08,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:08:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138496295] [2023-11-29 04:08:08,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:08,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:08:08,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:08,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:08:08,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:08:08,975 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:08:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:09,028 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2023-11-29 04:08:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:08:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-29 04:08:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:09,029 INFO L225 Difference]: With dead ends: 51 [2023-11-29 04:08:09,029 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 04:08:09,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:08:09,030 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:09,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:08:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 04:08:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-29 04:08:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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) [2023-11-29 04:08:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2023-11-29 04:08:09,039 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2023-11-29 04:08:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:09,039 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-11-29 04:08:09,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:08:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2023-11-29 04:08:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 04:08:09,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:09,040 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:09,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:08:09,041 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:09,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1596717782, now seen corresponding path program 1 times [2023-11-29 04:08:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495102695] [2023-11-29 04:08:09,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:08:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:08:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:08:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495102695] [2023-11-29 04:08:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495102695] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:08:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707515909] [2023-11-29 04:08:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:09,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:09,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:09,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:08:09,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:08:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:09,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:08:09,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:08:09,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:08:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:08:09,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707515909] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:08:09,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:08:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-29 04:08:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134703978] [2023-11-29 04:08:09,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:08:09,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:08:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:09,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:08:09,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:08:09,510 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:08:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:09,615 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-11-29 04:08:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:08:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-11-29 04:08:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:09,616 INFO L225 Difference]: With dead ends: 49 [2023-11-29 04:08:09,616 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 04:08:09,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:08:09,618 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:09,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:08:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 04:08:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-29 04:08:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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) [2023-11-29 04:08:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-11-29 04:08:09,625 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 28 [2023-11-29 04:08:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:09,626 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-11-29 04:08:09,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:08:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-11-29 04:08:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 04:08:09,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:09,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:09,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:08:09,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 04:08:09,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:09,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1539459480, now seen corresponding path program 1 times [2023-11-29 04:08:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326847923] [2023-11-29 04:08:09,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:10,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:10,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:08:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:08:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:08:10,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:10,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326847923] [2023-11-29 04:08:10,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326847923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:08:10,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533879400] [2023-11-29 04:08:10,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:10,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:10,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:10,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:08:10,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:08:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:10,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 04:08:10,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:10,498 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 [2023-11-29 04:08:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:08:10,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:08:10,558 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 8 treesize of output 4 [2023-11-29 04:08:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:08:10,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533879400] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:08:10,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:08:10,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-11-29 04:08:10,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574779659] [2023-11-29 04:08:10,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:08:10,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 04:08:10,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:10,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 04:08:10,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:08:10,582 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 04:08:14,586 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] [2023-11-29 04:08:18,597 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] [2023-11-29 04:08:22,606 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] [2023-11-29 04:08:26,634 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] [2023-11-29 04:08:30,841 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] [2023-11-29 04:08:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:30,847 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-11-29 04:08:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:08:30,847 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 28 [2023-11-29 04:08:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:30,848 INFO L225 Difference]: With dead ends: 49 [2023-11-29 04:08:30,848 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 04:08:30,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:08:30,849 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 53 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:30,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 276 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-11-29 04:08:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 04:08:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2023-11-29 04:08:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2023-11-29 04:08:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-29 04:08:30,855 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2023-11-29 04:08:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:30,855 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 04:08:30,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 04:08:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-29 04:08:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:08:30,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:30,856 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:30,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:08:31,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 04:08:31,057 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:31,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash -152500382, now seen corresponding path program 1 times [2023-11-29 04:08:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:31,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133577938] [2023-11-29 04:08:31,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:31,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:31,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:08:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:31,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:08:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:08:31,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:31,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133577938] [2023-11-29 04:08:31,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133577938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:08:31,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809356006] [2023-11-29 04:08:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:31,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:31,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:31,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:08:31,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:08:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:31,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:08:31,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:08:31,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:08:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:08:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809356006] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:08:31,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:08:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-11-29 04:08:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888879499] [2023-11-29 04:08:31,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:08:31,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:08:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:31,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:08:31,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:08:31,585 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:08:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:31,688 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2023-11-29 04:08:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:08:31,688 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-11-29 04:08:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:31,689 INFO L225 Difference]: With dead ends: 44 [2023-11-29 04:08:31,689 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 04:08:31,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:08:31,690 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:31,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 129 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:08:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 04:08:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-29 04:08:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:08:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-29 04:08:31,697 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2023-11-29 04:08:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:31,697 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-29 04:08:31,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:08:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-29 04:08:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:08:31,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:31,699 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:31,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:08:31,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:31,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:31,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash -152544092, now seen corresponding path program 1 times [2023-11-29 04:08:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:31,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704669448] [2023-11-29 04:08:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:08:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:08:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:32,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:08:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:08:33,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:33,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704669448] [2023-11-29 04:08:33,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704669448] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:08:33,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046216103] [2023-11-29 04:08:33,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:33,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:33,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:33,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:08:33,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:08:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:33,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-29 04:08:33,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:33,302 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 [2023-11-29 04:08:33,471 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 [2023-11-29 04:08:33,554 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 [2023-11-29 04:08:33,628 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:08:33,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:08:33,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:08:33,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2023-11-29 04:08:33,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 04:08:33,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 04:08:33,944 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 04:08:33,945 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 93 treesize of output 62 [2023-11-29 04:08:33,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-11-29 04:08:33,954 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 [2023-11-29 04:08:34,016 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 [2023-11-29 04:08:34,118 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 [2023-11-29 04:08:34,124 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 [2023-11-29 04:08:34,134 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 [2023-11-29 04:08:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:08:34,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:08:34,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:34,266 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 69 treesize of output 70 [2023-11-29 04:08:34,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:34,277 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 136 treesize of output 139 [2023-11-29 04:08:34,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:34,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 108 [2023-11-29 04:08:34,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2023-11-29 04:08:34,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:34,309 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 190 treesize of output 181 [2023-11-29 04:08:34,317 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 31 [2023-11-29 04:08:34,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse4 (= .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse0 (and (forall ((v_ArrVal_1272 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse13 (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1272))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_33 Int)) (= (select (select .cse13 v_arrayElimCell_30) (+ 4 v_arrayElimCell_33)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1272))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 4 v_arrayElimCell_32))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_33 Int)) (= (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse15) v_arrayElimCell_30) (+ 4 v_arrayElimCell_33)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse4 (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1272) (+ 4 v_arrayElimCell_32))))) (or (forall ((v_ArrVal_1272 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1272))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))) .cse4))) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse12)) (.cse3 (and (or .cse4 (forall ((v_ArrVal_1272 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1272))) v_arrayElimCell_29) .cse5)))) (forall ((v_ArrVal_1272 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int))) (let ((.cse10 (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1272))))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_33 Int)) (= (select (select .cse10 v_arrayElimCell_30) (+ 4 v_arrayElimCell_33)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_29) .cse5)))))))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse0 .cse2) (or .cse4 (forall ((v_ArrVal_1268 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse5)))) (or (not .cse4) (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1272 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_33 Int)) (= (select (select (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1272))) v_arrayElimCell_30) (+ 4 v_arrayElimCell_33)) |c_ULTIMATE.start_main_~uneq~0#1|))) (or .cse1 .cse3) (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse5)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_33 Int)) (= (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1272)) v_arrayElimCell_30) (+ 4 v_arrayElimCell_33)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))))) is different from false [2023-11-29 04:08:35,412 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse8 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse13)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (and (or .cse8 (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| .cse5 v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1272) (+ 4 v_arrayElimCell_32))))) (or .cse8 (forall ((v_ArrVal_1272 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse14 (store |c_#memory_int#1| .cse5 v_ArrVal_1268))) (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1272))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))) (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse15 (store |c_#memory_int#1| .cse5 v_ArrVal_1268))) (let ((.cse16 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1272))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_33 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse16) v_arrayElimCell_30) (+ 4 v_arrayElimCell_33)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 4 v_arrayElimCell_32))))))) (forall ((v_ArrVal_1272 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse17 (let ((.cse18 (store |c_#memory_int#1| .cse5 v_ArrVal_1268))) (store .cse18 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1272))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_33 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_30) (+ 4 v_arrayElimCell_33))))))))) (.cse7 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (= .cse5 .cse13)) (.cse6 (and (or .cse8 (forall ((v_ArrVal_1272 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse10 (store |c_#memory_int#1| .cse5 v_ArrVal_1268))) (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1272))) v_arrayElimCell_29) .cse4)))) (forall ((v_ArrVal_1272 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_int#1| .cse5 v_ArrVal_1268))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1272))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_29) .cse4)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_33 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_30) (+ 4 v_arrayElimCell_33)))))))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| .cse5 v_ArrVal_1268))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_33 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1272)) v_arrayElimCell_30) (+ 4 v_arrayElimCell_33)))) (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse6 .cse7) (or .cse0 .cse7) (or .cse8 (forall ((v_ArrVal_1268 (Array Int Int))) (= (select (select (store |c_#memory_int#1| .cse5 v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse4) |c_ULTIMATE.start_main_~uneq~0#1|))) (or (not .cse8) (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1272 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_33 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse9 (store |c_#memory_int#1| .cse5 v_ArrVal_1268))) (store .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1272))) v_arrayElimCell_30) (+ 4 v_arrayElimCell_33))))) (or .cse1 .cse6))))) is different from false [2023-11-29 04:08:44,963 WARN L293 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 808 DAG size of output: 760 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 04:08:44,964 INFO L349 Elim1Store]: treesize reduction 252, result has 86.4 percent of original size [2023-11-29 04:08:44,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 17 new quantified variables, introduced 137 case distinctions, treesize of input 2575 treesize of output 3680 [2023-11-29 04:08:45,944 INFO L224 Elim1Store]: Index analysis took 259 ms [2023-11-29 04:08:48,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:48,912 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 2624 treesize of output 3602 [2023-11-29 04:08:49,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:49,832 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 2303 treesize of output 2288 [2023-11-29 04:08:50,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:50,721 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 2321 treesize of output 2314 [2023-11-29 04:08:51,576 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 2333 treesize of output 2321 [2023-11-29 04:08:52,430 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 2335 treesize of output 2331 [2023-11-29 04:08:53,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:53,379 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 2359 treesize of output 2350 [2023-11-29 04:08:54,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:54,281 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 2397 treesize of output 2382 [2023-11-29 04:08:55,138 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 2387 treesize of output 2383 [2023-11-29 04:08:55,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2411 treesize of output 2399 [2023-11-29 04:08:56,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:56,872 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 2441 treesize of output 2434 [2023-11-29 04:08:57,746 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 2425 treesize of output 2423 [2023-11-29 04:08:58,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:08:58,661 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 2451 treesize of output 2446 [2023-11-29 04:08:59,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 2465 treesize of output 2453 [2023-11-29 04:09:00,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:09:00,437 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 2481 treesize of output 2472 [2023-11-29 04:09:01,339 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 2463 treesize of output 2457 [2023-11-29 04:09:02,236 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 2457 treesize of output 2451 [2023-11-29 04:10:50,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 04:14:15,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 04:14:15,151 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 04:14:15,153 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 04:14:15,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 04:14:15,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:14:15,354 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_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/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.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.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.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) 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$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.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) 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:338) 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:338) 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:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) 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) ... 84 more [2023-11-29 04:14:15,357 INFO L158 Benchmark]: Toolchain (without parser) took 374562.47ms. Allocated memory was 151.0MB in the beginning and 513.8MB in the end (delta: 362.8MB). Free memory was 109.8MB in the beginning and 422.0MB in the end (delta: -312.2MB). Peak memory consumption was 318.9MB. Max. memory is 16.1GB. [2023-11-29 04:14:15,357 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:14:15,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.60ms. Allocated memory is still 151.0MB. Free memory was 109.4MB in the beginning and 91.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 04:14:15,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.00ms. Allocated memory is still 151.0MB. Free memory was 91.3MB in the beginning and 89.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:14:15,358 INFO L158 Benchmark]: Boogie Preprocessor took 68.43ms. Allocated memory is still 151.0MB. Free memory was 89.0MB in the beginning and 85.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:14:15,358 INFO L158 Benchmark]: RCFGBuilder took 524.62ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 85.2MB in the beginning and 163.9MB in the end (delta: -78.7MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2023-11-29 04:14:15,358 INFO L158 Benchmark]: TraceAbstraction took 373472.80ms. Allocated memory was 203.4MB in the beginning and 513.8MB in the end (delta: 310.4MB). Free memory was 162.8MB in the beginning and 422.0MB in the end (delta: -259.2MB). Peak memory consumption was 317.3MB. Max. memory is 16.1GB. [2023-11-29 04:14:15,360 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.21ms. Allocated memory is still 102.8MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.60ms. Allocated memory is still 151.0MB. Free memory was 109.4MB in the beginning and 91.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.00ms. Allocated memory is still 151.0MB. Free memory was 91.3MB in the beginning and 89.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.43ms. Allocated memory is still 151.0MB. Free memory was 89.0MB in the beginning and 85.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 524.62ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 85.2MB in the beginning and 163.9MB in the end (delta: -78.7MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 373472.80ms. Allocated memory was 203.4MB in the beginning and 513.8MB in the end (delta: 310.4MB). Free memory was 162.8MB in the beginning and 422.0MB in the end (delta: -259.2MB). Peak memory consumption was 317.3MB. 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_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/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_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya --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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:14:17,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:14:17,163 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:14:17,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:14:17,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:14:17,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:14:17,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:14:17,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:14:17,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:14:17,200 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:14:17,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:14:17,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:14:17,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:14:17,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:14:17,203 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:14:17,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:14:17,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:14:17,205 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:14:17,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:14:17,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:14:17,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:14:17,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:14:17,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:14:17,208 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:14:17,208 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:14:17,208 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:14:17,209 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:14:17,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:14:17,210 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:14:17,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:14:17,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:14:17,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:14:17,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:14:17,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:14:17,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:14:17,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:14:17,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:14:17,213 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:14:17,213 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:14:17,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:14:17,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:14:17,214 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:14:17,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:14:17,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:14:17,214 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:14:17,214 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-11-29 04:14:17,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:14:17,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:14:17,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:14:17,523 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:14:17,523 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:14:17,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-29 04:14:20,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:14:20,564 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:14:20,565 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-29 04:14:20,580 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/data/3426294f6/19baee1cf11d4a448b7304ebfc3bdf93/FLAG1d423da7d [2023-11-29 04:14:20,593 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/data/3426294f6/19baee1cf11d4a448b7304ebfc3bdf93 [2023-11-29 04:14:20,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:14:20,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:14:20,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:14:20,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:14:20,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:14:20,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:14:20" (1/1) ... [2023-11-29 04:14:20,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b40f2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:20, skipping insertion in model container [2023-11-29 04:14:20,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:14:20" (1/1) ... [2023-11-29 04:14:20,660 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:14:20,991 WARN L240 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_cc6583f5-bbd0-4896-824f-7013b52c654b/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-29 04:14:20,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:14:21,010 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:14:21,055 WARN L240 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_cc6583f5-bbd0-4896-824f-7013b52c654b/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-29 04:14:21,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:14:21,092 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:14:21,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21 WrapperNode [2023-11-29 04:14:21,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:14:21,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:14:21,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:14:21,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:14:21,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,150 INFO L138 Inliner]: procedures = 130, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 175 [2023-11-29 04:14:21,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:14:21,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:14:21,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:14:21,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:14:21,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,193 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 10, 18]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2023-11-29 04:14:21,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:14:21,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:14:21,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:14:21,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:14:21,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (1/1) ... [2023-11-29 04:14:21,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:14:21,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:14:21,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:14:21,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:14:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:14:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:14:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:14:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 04:14:21,299 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 04:14:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:14:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:14:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:14:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:14:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:14:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:14:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:14:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:14:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:14:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:14:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:14:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:14:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:14:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:14:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:14:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:14:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:14:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:14:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:14:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:14:21,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:14:21,455 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:14:21,458 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:14:21,835 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:14:21,869 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:14:21,869 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 04:14:21,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:14:21 BoogieIcfgContainer [2023-11-29 04:14:21,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:14:21,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:14:21,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:14:21,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:14:21,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:14:20" (1/3) ... [2023-11-29 04:14:21,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5283b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:14:21, skipping insertion in model container [2023-11-29 04:14:21,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:14:21" (2/3) ... [2023-11-29 04:14:21,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5283b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:14:21, skipping insertion in model container [2023-11-29 04:14:21,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:14:21" (3/3) ... [2023-11-29 04:14:21,878 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-11-29 04:14:21,896 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:14:21,897 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:14:21,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:14:21,946 INFO L357 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, mHoare=true, 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;@3ffc9001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:14:21,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:14:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 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) [2023-11-29 04:14:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:14:21,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:14:21,959 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:14:21,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:14:21,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:14:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash -143673426, now seen corresponding path program 1 times [2023-11-29 04:14:21,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:14:21,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334997385] [2023-11-29 04:14:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:14:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:14:21,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:14:21,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:14:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:14:22,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:14:22,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:14:22,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:14:22,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:14:22,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334997385] [2023-11-29 04:14:22,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334997385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:14:22,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:14:22,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:14:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692896436] [2023-11-29 04:14:22,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:14:22,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:14:22,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:14:22,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:14:22,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:14:22,229 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-29 04:14:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:14:22,350 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2023-11-29 04:14:22,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:14:22,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2023-11-29 04:14:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:14:22,360 INFO L225 Difference]: With dead ends: 64 [2023-11-29 04:14:22,361 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 04:14:22,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:14:22,367 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 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 [2023-11-29 04:14:22,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:14:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 04:14:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 04:14:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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) [2023-11-29 04:14:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-11-29 04:14:22,432 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 19 [2023-11-29 04:14:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:14:22,433 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-11-29 04:14:22,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-29 04:14:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-11-29 04:14:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:14:22,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:14:22,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:14:22,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:14:22,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:22,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:14:22,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:14:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1502228012, now seen corresponding path program 1 times [2023-11-29 04:14:22,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:14:22,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890754551] [2023-11-29 04:14:22,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:14:22,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:22,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:14:22,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:14:22,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:14:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:14:22,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:14:22,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:14:22,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:14:22,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:14:22,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890754551] [2023-11-29 04:14:22,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890754551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:14:22,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:14:22,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:14:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077428630] [2023-11-29 04:14:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:14:22,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:14:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:14:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:14:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:14:22,847 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:14:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:14:22,949 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2023-11-29 04:14:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:14:22,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-29 04:14:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:14:22,951 INFO L225 Difference]: With dead ends: 53 [2023-11-29 04:14:22,951 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 04:14:22,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:14:22,953 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:14:22,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:14:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 04:14:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-29 04:14:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 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) [2023-11-29 04:14:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2023-11-29 04:14:22,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2023-11-29 04:14:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:14:22,961 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2023-11-29 04:14:22,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:14:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2023-11-29 04:14:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:14:22,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:14:22,963 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:14:22,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:14:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:23,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:14:23,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:14:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1969454644, now seen corresponding path program 1 times [2023-11-29 04:14:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:14:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270214881] [2023-11-29 04:14:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:14:23,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:23,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:14:23,168 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:14:23,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:14:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:14:23,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:14:23,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:14:23,444 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:14:23,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:14:23,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270214881] [2023-11-29 04:14:23,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270214881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:14:23,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:14:23,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:14:23,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012433322] [2023-11-29 04:14:23,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:14:23,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:14:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:14:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:14:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:14:23,448 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:14:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:14:23,569 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-11-29 04:14:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:14:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-11-29 04:14:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:14:23,571 INFO L225 Difference]: With dead ends: 45 [2023-11-29 04:14:23,572 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 04:14:23,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:14:23,574 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:14:23,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 62 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:14:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 04:14:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 04:14:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:14:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2023-11-29 04:14:23,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 25 [2023-11-29 04:14:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:14:23,584 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2023-11-29 04:14:23,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:14:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2023-11-29 04:14:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 04:14:23,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:14:23,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:14:23,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:14:23,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:23,791 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:14:23,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:14:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1835723964, now seen corresponding path program 1 times [2023-11-29 04:14:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:14:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468345520] [2023-11-29 04:14:23,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:14:23,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:23,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:14:23,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:14:23,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:14:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:14:24,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 04:14:24,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:24,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:14:24,320 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 [2023-11-29 04:14:24,430 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:14:24,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:14:24,544 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 [2023-11-29 04:14:24,678 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 [2023-11-29 04:14:24,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 04:14:24,838 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 [2023-11-29 04:14:25,087 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 04:14:25,088 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 [2023-11-29 04:14:25,143 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 04:14:25,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-11-29 04:14:25,649 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 59 treesize of output 26 [2023-11-29 04:14:25,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-29 04:14:25,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 04:14:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:14:25,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:14:26,798 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| (_ BitVec 32)) (v_ArrVal_227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12|))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| v_ArrVal_227) .cse0) .cse1 (select v_ArrVal_222 .cse1))) v_ArrVal_222)) (= (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_222) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| v_ArrVal_223) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (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|))) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-11-29 04:14:26,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:14:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468345520] [2023-11-29 04:14:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468345520] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:14:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [234099280] [2023-11-29 04:14:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:14:26,804 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:14:26,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:14:26,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:14:26,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-11-29 04:14:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:14:27,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 04:14:27,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:27,200 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 [2023-11-29 04:14:27,424 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 [2023-11-29 04:14:27,490 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:14:27,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:14:27,607 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 [2023-11-29 04:14:27,808 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 [2023-11-29 04:14:27,990 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 [2023-11-29 04:14:27,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 04:14:32,340 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 04:14:32,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-11-29 04:14:32,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:14:32,909 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-29 04:14:32,915 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 [2023-11-29 04:14:33,070 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 [2023-11-29 04:14:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:14:33,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:14:33,906 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| (_ BitVec 32)) (v_ArrVal_301 (_ BitVec 32)) (v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_int#2| .cse0 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_305) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_301))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_300) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (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|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 04:14:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [234099280] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:14:33,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:14:33,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2023-11-29 04:14:33,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619297685] [2023-11-29 04:14:33,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:14:33,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 04:14:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:14:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 04:14:33,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1695, Unknown=51, NotChecked=170, Total=2070 [2023-11-29 04:14:33,914 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:14:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:14:38,895 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-11-29 04:14:38,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:14:38,896 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-29 04:14:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:14:38,898 INFO L225 Difference]: With dead ends: 54 [2023-11-29 04:14:38,898 INFO L226 Difference]: Without dead ends: 52 [2023-11-29 04:14:38,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=241, Invalid=2578, Unknown=51, NotChecked=210, Total=3080 [2023-11-29 04:14:38,901 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 62 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:14:38,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 397 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 04:14:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-29 04:14:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2023-11-29 04:14:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.34375) internal successors, (43), 32 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) [2023-11-29 04:14:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2023-11-29 04:14:38,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 26 [2023-11-29 04:14:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:14:38,912 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2023-11-29 04:14:38,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:14:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2023-11-29 04:14:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 04:14:38,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:14:38,913 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:14:38,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-29 04:14:39,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-11-29 04:14:39,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:14:39,314 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:14:39,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:14:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 462823476, now seen corresponding path program 2 times [2023-11-29 04:14:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:14:39,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267650157] [2023-11-29 04:14:39,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:14:39,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:14:39,316 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:14:39,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:14:39,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:14:39,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:14:39,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:14:39,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:14:39,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:14:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:14:40,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:14:40,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267650157] [2023-11-29 04:14:40,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267650157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:14:40,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:14:40,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 04:14:40,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808675247] [2023-11-29 04:14:40,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:14:40,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:14:40,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:14:40,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:14:40,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:14:40,056 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 04:14:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:14:40,277 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2023-11-29 04:14:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:14:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-11-29 04:14:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:14:40,278 INFO L225 Difference]: With dead ends: 52 [2023-11-29 04:14:40,278 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 04:14:40,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:14:40,279 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:14:40,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 129 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:14:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 04:14:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-29 04:14:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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) [2023-11-29 04:14:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2023-11-29 04:14:40,288 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2023-11-29 04:14:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:14:40,289 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-11-29 04:14:40,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 04:14:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2023-11-29 04:14:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 04:14:40,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:14:40,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:14:40,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 04:14:40,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:40,491 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:14:40,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:14:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1596717782, now seen corresponding path program 1 times [2023-11-29 04:14:40,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:14:40,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291949629] [2023-11-29 04:14:40,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:14:40,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:40,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:14:40,493 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:14:40,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:14:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:14:40,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 04:14:40,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:40,725 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 [2023-11-29 04:14:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:14:40,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:14:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:14:40,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:14:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291949629] [2023-11-29 04:14:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291949629] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:14:40,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:14:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-11-29 04:14:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710714431] [2023-11-29 04:14:40,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:14:40,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:14:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:14:40,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:14:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:14:40,804 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 04:14:44,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:14:48,888 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] [2023-11-29 04:14:52,942 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] [2023-11-29 04:14:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:14:53,342 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2023-11-29 04:14:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:14:53,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-11-29 04:14:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:14:53,344 INFO L225 Difference]: With dead ends: 49 [2023-11-29 04:14:53,344 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 04:14:53,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:14:53,345 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:14:53,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 216 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2023-11-29 04:14:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 04:14:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2023-11-29 04:14:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2023-11-29 04:14:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-29 04:14:53,352 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2023-11-29 04:14:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:14:53,353 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 04:14:53,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 04:14:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-29 04:14:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:14:53,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:14:53,354 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:14:53,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:14:53,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:53,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:14:53,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:14:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash -152500382, now seen corresponding path program 1 times [2023-11-29 04:14:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:14:53,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902815665] [2023-11-29 04:14:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:14:53,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:14:53,556 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:14:53,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:14:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:14:53,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:14:53,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 04:14:53,766 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:14:53,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:14:53,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902815665] [2023-11-29 04:14:53,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902815665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:14:53,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:14:53,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:14:53,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595050475] [2023-11-29 04:14:53,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:14:53,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:14:53,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:14:53,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:14:53,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:14:53,768 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:14:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:14:53,944 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2023-11-29 04:14:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:14:53,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-29 04:14:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:14:53,945 INFO L225 Difference]: With dead ends: 44 [2023-11-29 04:14:53,946 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 04:14:53,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:14:53,947 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:14:53,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 69 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:14:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 04:14:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-29 04:14:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:14:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-29 04:14:53,958 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2023-11-29 04:14:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:14:53,959 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-29 04:14:53,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:14:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-29 04:14:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:14:53,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:14:53,961 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:14:53,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 04:14:54,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:54,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:14:54,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:14:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash -152544092, now seen corresponding path program 1 times [2023-11-29 04:14:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:14:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268458909] [2023-11-29 04:14:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:14:54,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:14:54,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:14:54,166 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:14:54,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc6583f5-bbd0-4896-824f-7013b52c654b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:14:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:14:54,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-29 04:14:54,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:54,427 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 [2023-11-29 04:14:54,513 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 [2023-11-29 04:14:54,560 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 [2023-11-29 04:14:54,620 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 04:14:54,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 04:14:54,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:14:54,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2023-11-29 04:14:54,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-29 04:14:54,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-29 04:14:54,933 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 04:14:54,934 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 121 treesize of output 90 [2023-11-29 04:14:54,941 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 48 treesize of output 19 [2023-11-29 04:14:54,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2023-11-29 04:14:55,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2023-11-29 04:14:55,036 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 46 treesize of output 30 [2023-11-29 04:14:55,124 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 [2023-11-29 04:14:55,133 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 [2023-11-29 04:14:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:14:55,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:14:55,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:14:55,474 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 61 treesize of output 62 [2023-11-29 04:14:55,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:14:55,511 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 120 treesize of output 123 [2023-11-29 04:14:55,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:14:55,530 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 100 treesize of output 92 [2023-11-29 04:14:55,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:14:55,586 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 170 treesize of output 161 [2023-11-29 04:14:55,603 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 35 treesize of output 29 [2023-11-29 04:14:55,614 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 23 [2023-11-29 04:14:56,411 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse15))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse15)) (.cse3 (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_43 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568))) (or (not (= v_ArrVal_563 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= (select v_ArrVal_563 (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_563) v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46)))))))) (.cse1 (and (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_43 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568))) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_563))) (or (not (= v_ArrVal_563 (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= (select (select .cse9 v_arrayElimCell_41) (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46)))))))) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_563))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_41) .cse6)) (not (= v_ArrVal_563 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46)))))))) (or .cse2 (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_563) v_arrayElimCell_41) .cse6)) (not (= v_ArrVal_563 (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (or .cse2 (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_43 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568))) (or (not (= v_ArrVal_563 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_563) v_arrayElimCell_41) (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (.cse4 (= (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_circular_insert_~snd_to_last~0#1.offset|))) (and (or .cse0 .cse1) (or (and (or .cse2 (forall ((v_arrayElimCell_43 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_1) (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse3) .cse4) (or (not .cse2) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568))) (or (not (= v_ArrVal_563 (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_563) v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46))))))) (or .cse0 (and (or (forall ((v_arrayElimCell_43 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2) (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse2) .cse3)) (or .cse1 .cse4) (or (forall ((v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse6) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse2) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_568))) (or (not (= v_ArrVal_563 (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_563 .cse6)) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_563) v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46))))))))))) is different from false [2023-11-29 04:15:11,099 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 04:15:11,100 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 11 treesize of output 11 [2023-11-29 04:15:11,244 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 04:15:11,244 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 11 treesize of output 11 [2023-11-29 04:15:11,542 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse15)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse3 (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_43 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#2| .cse1 v_ArrVal_568))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_563) v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46)))) (= (select v_ArrVal_563 (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_563 (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))))))) (.cse0 (= .cse1 .cse15)) (.cse5 (and (or (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_43 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#2| .cse1 v_ArrVal_568))) (or (not (= v_ArrVal_563 (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_563) v_arrayElimCell_41) (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse2) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_43 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#2| .cse1 v_ArrVal_568))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_563))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46)))) (not (= v_ArrVal_563 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select (select .cse10 v_arrayElimCell_41) (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#2| .cse1 v_ArrVal_568))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_563))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46)))) (not (= v_ArrVal_563 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select (select .cse12 v_arrayElimCell_41) .cse8) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#2| .cse1 v_ArrVal_568))) (or (not (= v_ArrVal_563 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_563) v_arrayElimCell_41) .cse8) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse2))) (.cse4 (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 (and (or (forall ((v_arrayElimCell_43 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (select (store |c_#memory_int#2| .cse1 v_ArrVal_568) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_2) (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse2) .cse3)) (or (and .cse3 (or (forall ((v_arrayElimCell_43 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (select (store |c_#memory_int#2| .cse1 v_ArrVal_568) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_1) (bvadd (_ bv4 32) v_arrayElimCell_43)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse2)) .cse4) (or .cse5 .cse0) (or (not .cse2) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#2| .cse1 v_ArrVal_568))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_563) v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46))) (not (= v_ArrVal_563 (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))))))) (or .cse5 .cse4) (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#2| .cse1 v_ArrVal_568))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_563) v_arrayElimCell_45) (bvadd (_ bv4 32) v_arrayElimCell_46)))) (= (select v_ArrVal_563 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_563 (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_563 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|))))))) (or (forall ((v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| .cse1 v_ArrVal_568) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse8))) .cse2))))) is different from false