./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.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_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme --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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:47:49,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:47:50,085 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:47:50,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:47:50,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:47:50,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:47:50,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:47:50,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:47:50,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:47:50,121 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:47:50,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:47:50,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:47:50,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:47:50,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:47:50,124 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:47:50,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:47:50,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:47:50,126 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:47:50,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:47:50,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:47:50,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:47:50,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:47:50,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:47:50,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:47:50,130 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:47:50,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:47:50,131 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:47:50,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:47:50,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:47:50,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:47:50,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:47:50,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:50,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:47:50,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:47:50,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:47:50,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:47:50,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:47:50,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:47:50,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:47:50,138 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:47:50,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:47:50,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:47:50,140 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_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/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_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2023-11-26 11:47:50,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:47:50,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:47:50,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:47:50,512 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:47:50,512 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:47:50,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-11-26 11:47:53,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:47:54,242 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:47:54,243 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-11-26 11:47:54,272 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/data/74d637247/876bb1e47c5046eb85b40e08c7ce4b49/FLAG5f830de3c [2023-11-26 11:47:54,292 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/data/74d637247/876bb1e47c5046eb85b40e08c7ce4b49 [2023-11-26 11:47:54,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:47:54,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:47:54,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:54,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:47:54,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:47:54,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:54" (1/1) ... [2023-11-26 11:47:54,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de19ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:54, skipping insertion in model container [2023-11-26 11:47:54,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:54" (1/1) ... [2023-11-26 11:47:54,387 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:47:54,926 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_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-11-26 11:47:55,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:55,030 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:47:55,100 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_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-11-26 11:47:55,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:55,227 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:47:55,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55 WrapperNode [2023-11-26 11:47:55,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:55,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:55,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:47:55,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:47:55,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,320 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2023-11-26 11:47:55,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:55,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:47:55,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:47:55,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:47:55,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,400 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2023-11-26 11:47:55,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:47:55,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:47:55,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:47:55,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:47:55,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (1/1) ... [2023-11-26 11:47:55,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:55,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:55,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:47:55,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:47:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 11:47:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 11:47:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-11-26 11:47:55,573 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-11-26 11:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-26 11:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-26 11:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-11-26 11:47:55,576 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-11-26 11:47:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:47:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:47:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-26 11:47:55,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-26 11:47:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:47:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:47:55,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:47:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:47:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 11:47:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 11:47:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-11-26 11:47:55,598 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-11-26 11:47:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:47:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:47:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:47:55,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:47:55,788 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:47:55,791 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:47:56,229 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:47:56,312 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:47:56,312 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-11-26 11:47:56,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:56 BoogieIcfgContainer [2023-11-26 11:47:56,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:47:56,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:47:56,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:47:56,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:47:56,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:47:54" (1/3) ... [2023-11-26 11:47:56,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4976b92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:56, skipping insertion in model container [2023-11-26 11:47:56,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:55" (2/3) ... [2023-11-26 11:47:56,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4976b92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:56, skipping insertion in model container [2023-11-26 11:47:56,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:56" (3/3) ... [2023-11-26 11:47:56,325 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-11-26 11:47:56,348 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:47:56,348 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:47:56,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:47:56,408 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;@35ba6261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:47:56,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:47:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-26 11:47:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-26 11:47:56,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:56,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:56,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:56,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:56,432 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-11-26 11:47:56,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:56,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203574980] [2023-11-26 11:47:56,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:56,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:56,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203574980] [2023-11-26 11:47:56,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203574980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:56,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:56,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:56,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580953229] [2023-11-26 11:47:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:56,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:47:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:47:56,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:56,683 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:56,771 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2023-11-26 11:47:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:47:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-26 11:47:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:56,785 INFO L225 Difference]: With dead ends: 210 [2023-11-26 11:47:56,785 INFO L226 Difference]: Without dead ends: 99 [2023-11-26 11:47:56,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:56,798 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:56,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-26 11:47:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-26 11:47:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-26 11:47:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-11-26 11:47:56,846 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2023-11-26 11:47:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:56,846 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-11-26 11:47:56,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-11-26 11:47:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-26 11:47:56,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:56,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:56,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:47:56,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:56,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:56,851 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2023-11-26 11:47:56,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:56,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233008753] [2023-11-26 11:47:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-26 11:47:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:57,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233008753] [2023-11-26 11:47:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233008753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595715119] [2023-11-26 11:47:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:57,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:57,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:57,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:57,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:57,308 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:47:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:57,708 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-11-26 11:47:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:47:57,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-26 11:47:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:57,711 INFO L225 Difference]: With dead ends: 101 [2023-11-26 11:47:57,712 INFO L226 Difference]: Without dead ends: 98 [2023-11-26 11:47:57,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:47:57,714 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 233 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:57,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 87 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:47:57,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-26 11:47:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-26 11:47:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-26 11:47:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-11-26 11:47:57,736 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2023-11-26 11:47:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:57,738 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-11-26 11:47:57,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:47:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-11-26 11:47:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-26 11:47:57,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:57,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:57,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:47:57,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:57,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2023-11-26 11:47:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:57,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106690484] [2023-11-26 11:47:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-26 11:47:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:58,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106690484] [2023-11-26 11:47:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106690484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:58,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:58,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 11:47:58,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738258934] [2023-11-26 11:47:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:58,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 11:47:58,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:58,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 11:47:58,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:47:58,619 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:47:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:59,945 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2023-11-26 11:47:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:47:59,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-26 11:47:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:59,950 INFO L225 Difference]: With dead ends: 187 [2023-11-26 11:47:59,950 INFO L226 Difference]: Without dead ends: 181 [2023-11-26 11:47:59,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-11-26 11:47:59,952 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 462 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:59,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 122 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-26 11:47:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-26 11:47:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2023-11-26 11:47:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-26 11:47:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2023-11-26 11:47:59,992 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2023-11-26 11:47:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:59,993 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2023-11-26 11:47:59,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:47:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2023-11-26 11:47:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-26 11:47:59,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:59,994 INFO L195 NwaCegarLoop]: trace histogram [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-26 11:47:59,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:47:59,995 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:59,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2023-11-26 11:47:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655798904] [2023-11-26 11:47:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-26 11:48:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:01,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:01,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655798904] [2023-11-26 11:48:01,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655798904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:01,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:01,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-26 11:48:01,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604951915] [2023-11-26 11:48:01,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:01,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-26 11:48:01,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:01,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-26 11:48:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-26 11:48:01,215 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:02,501 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2023-11-26 11:48:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 11:48:02,502 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-11-26 11:48:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:02,504 INFO L225 Difference]: With dead ends: 259 [2023-11-26 11:48:02,505 INFO L226 Difference]: Without dead ends: 256 [2023-11-26 11:48:02,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-11-26 11:48:02,507 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 305 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:02,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 160 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-26 11:48:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-26 11:48:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2023-11-26 11:48:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 218 states have internal predecessors, (255), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 11:48:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 294 transitions. [2023-11-26 11:48:02,560 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 294 transitions. Word has length 23 [2023-11-26 11:48:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:02,561 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 294 transitions. [2023-11-26 11:48:02,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2023-11-26 11:48:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 11:48:02,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:02,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:02,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:48:02,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:02,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2023-11-26 11:48:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:02,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552790673] [2023-11-26 11:48:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:02,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-26 11:48:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:03,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552790673] [2023-11-26 11:48:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552790673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:03,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-26 11:48:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086858207] [2023-11-26 11:48:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:03,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-26 11:48:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:03,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-26 11:48:03,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-26 11:48:03,508 INFO L87 Difference]: Start difference. First operand 238 states and 294 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:04,930 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2023-11-26 11:48:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 11:48:04,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-11-26 11:48:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:04,933 INFO L225 Difference]: With dead ends: 258 [2023-11-26 11:48:04,933 INFO L226 Difference]: Without dead ends: 255 [2023-11-26 11:48:04,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-11-26 11:48:04,936 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 344 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:04,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 189 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-26 11:48:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-26 11:48:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2023-11-26 11:48:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.251231527093596) internal successors, (254), 218 states have internal predecessors, (254), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 11:48:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2023-11-26 11:48:05,000 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 26 [2023-11-26 11:48:05,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:05,001 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2023-11-26 11:48:05,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2023-11-26 11:48:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-26 11:48:05,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:05,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:05,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:48:05,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:05,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2023-11-26 11:48:05,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:05,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487069718] [2023-11-26 11:48:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:05,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-26 11:48:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487069718] [2023-11-26 11:48:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487069718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:06,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:06,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-26 11:48:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518736000] [2023-11-26 11:48:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:06,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:48:06,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:06,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:48:06,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:48:06,311 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:07,745 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2023-11-26 11:48:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 11:48:07,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-11-26 11:48:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:07,749 INFO L225 Difference]: With dead ends: 257 [2023-11-26 11:48:07,749 INFO L226 Difference]: Without dead ends: 254 [2023-11-26 11:48:07,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-26 11:48:07,752 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 332 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:07,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 176 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-26 11:48:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-26 11:48:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2023-11-26 11:48:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 218 states have internal predecessors, (253), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 11:48:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2023-11-26 11:48:07,809 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 29 [2023-11-26 11:48:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:07,810 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2023-11-26 11:48:07,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2023-11-26 11:48:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-26 11:48:07,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:07,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:07,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:48:07,813 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:07,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2023-11-26 11:48:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742557044] [2023-11-26 11:48:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:07,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-26 11:48:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:09,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:09,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742557044] [2023-11-26 11:48:09,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742557044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:09,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:09,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-26 11:48:09,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790482355] [2023-11-26 11:48:09,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:09,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:48:09,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:48:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:48:09,045 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:10,346 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2023-11-26 11:48:10,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 11:48:10,347 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-11-26 11:48:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:10,349 INFO L225 Difference]: With dead ends: 256 [2023-11-26 11:48:10,349 INFO L226 Difference]: Without dead ends: 253 [2023-11-26 11:48:10,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-26 11:48:10,350 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 325 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:10,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 173 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-26 11:48:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-26 11:48:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2023-11-26 11:48:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 218 states have internal predecessors, (252), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 11:48:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2023-11-26 11:48:10,402 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 32 [2023-11-26 11:48:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:10,402 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2023-11-26 11:48:10,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2023-11-26 11:48:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-26 11:48:10,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:10,405 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:10,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:48:10,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:10,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2023-11-26 11:48:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:10,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557793010] [2023-11-26 11:48:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:11,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-26 11:48:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:48:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:48:12,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:12,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557793010] [2023-11-26 11:48:12,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557793010] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:12,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414853455] [2023-11-26 11:48:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:12,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:12,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:12,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:48:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:12,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-26 11:48:12,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:12,355 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-26 11:48:12,356 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 16 [2023-11-26 11:48:12,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-26 11:48:12,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-26 11:48:12,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-26 11:48:12,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:12,875 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 17 [2023-11-26 11:48:12,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 11 [2023-11-26 11:48:12,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-11-26 11:48:12,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:12,917 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 19 [2023-11-26 11:48:12,923 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 21 treesize of output 11 [2023-11-26 11:48:13,000 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:48:13,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-26 11:48:13,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-26 11:48:13,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:48:13,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-26 11:48:13,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-26 11:48:13,251 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 17 treesize of output 12 [2023-11-26 11:48:13,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2023-11-26 11:48:13,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:13,431 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-11-26 11:48:13,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2023-11-26 11:48:13,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-26 11:48:13,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2023-11-26 11:48:13,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-26 11:48:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:13,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:48:14,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414853455] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:14,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 11:48:14,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2023-11-26 11:48:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143422215] [2023-11-26 11:48:14,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 11:48:14,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-26 11:48:14,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:14,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-26 11:48:14,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=751, Unknown=6, NotChecked=0, Total=870 [2023-11-26 11:48:14,158 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-26 11:48:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:17,226 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2023-11-26 11:48:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 11:48:17,227 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-11-26 11:48:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:17,229 INFO L225 Difference]: With dead ends: 258 [2023-11-26 11:48:17,229 INFO L226 Difference]: Without dead ends: 255 [2023-11-26 11:48:17,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=245, Invalid=1304, Unknown=11, NotChecked=0, Total=1560 [2023-11-26 11:48:17,232 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 718 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 169 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:17,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 154 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1400 Invalid, 2 Unknown, 0 Unchecked, 2.1s Time] [2023-11-26 11:48:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-26 11:48:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2023-11-26 11:48:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2352941176470589) internal successors, (252), 219 states have internal predecessors, (252), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 11:48:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2023-11-26 11:48:17,296 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 33 [2023-11-26 11:48:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:17,297 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2023-11-26 11:48:17,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-26 11:48:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2023-11-26 11:48:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-26 11:48:17,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:17,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:17,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:17,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:17,507 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:17,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1581408063, now seen corresponding path program 1 times [2023-11-26 11:48:17,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:17,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664222307] [2023-11-26 11:48:17,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-26 11:48:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:18,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664222307] [2023-11-26 11:48:18,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664222307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:18,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-26 11:48:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657166639] [2023-11-26 11:48:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:18,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:48:18,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:48:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:48:18,507 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:19,826 INFO L93 Difference]: Finished difference Result 257 states and 306 transitions. [2023-11-26 11:48:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 11:48:19,827 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-11-26 11:48:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:19,829 INFO L225 Difference]: With dead ends: 257 [2023-11-26 11:48:19,829 INFO L226 Difference]: Without dead ends: 254 [2023-11-26 11:48:19,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-11-26 11:48:19,830 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 398 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:19,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 163 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-26 11:48:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-26 11:48:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-11-26 11:48:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2303921568627452) internal successors, (251), 219 states have internal predecessors, (251), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 11:48:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 290 transitions. [2023-11-26 11:48:19,890 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 290 transitions. Word has length 35 [2023-11-26 11:48:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:19,891 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 290 transitions. [2023-11-26 11:48:19,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:48:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 290 transitions. [2023-11-26 11:48:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-26 11:48:19,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:19,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:19,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:48:19,893 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:19,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1738679921, now seen corresponding path program 1 times [2023-11-26 11:48:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417831307] [2023-11-26 11:48:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:19,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-26 11:48:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:48:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:48:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417831307] [2023-11-26 11:48:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417831307] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652266953] [2023-11-26 11:48:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:21,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:21,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:21,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:21,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0559ce0-895e-44df-a2b3-b0840bb3f6b2/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:48:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:21,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-26 11:48:21,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:21,953 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-26 11:48:21,954 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 16 [2023-11-26 11:48:22,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-26 11:48:22,091 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2023-11-26 11:48:22,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:22,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2023-11-26 11:48:22,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2023-11-26 11:48:22,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-26 11:48:22,138 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-26 11:48:22,139 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 88 [2023-11-26 11:48:22,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:22,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-11-26 11:48:22,246 INFO L349 Elim1Store]: treesize reduction 20, result has 54.5 percent of original size [2023-11-26 11:48:22,247 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 33 treesize of output 51 [2023-11-26 11:48:22,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 97 [2023-11-26 11:48:22,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:22,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2023-11-26 11:48:22,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2023-11-26 11:48:22,356 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-26 11:48:22,357 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 81 [2023-11-26 11:48:22,362 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:48:22,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-11-26 11:48:22,371 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 16 treesize of output 15 [2023-11-26 11:48:22,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:48:22,386 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 21 [2023-11-26 11:48:22,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2023-11-26 11:48:22,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:48:22,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2023-11-26 11:48:22,423 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 63 treesize of output 59 [2023-11-26 11:48:22,435 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 12 treesize of output 1 [2023-11-26 11:48:22,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 159 [2023-11-26 11:48:22,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:22,868 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:48:22,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 57 treesize of output 56 [2023-11-26 11:48:22,927 INFO L349 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-11-26 11:48:22,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2023-11-26 11:48:22,951 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-26 11:48:22,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-11-26 11:48:23,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:23,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:23,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2023-11-26 11:48:23,303 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 103 treesize of output 98 [2023-11-26 11:48:23,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:23,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2023-11-26 11:48:23,329 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-26 11:48:23,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2023-11-26 11:48:23,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2023-11-26 11:48:23,483 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:48:23,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-26 11:48:23,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-11-26 11:48:23,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-26 11:48:23,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 172 [2023-11-26 11:48:24,049 INFO L349 Elim1Store]: treesize reduction 120, result has 11.1 percent of original size [2023-11-26 11:48:24,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 198 [2023-11-26 11:48:24,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:24,106 INFO L349 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2023-11-26 11:48:24,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 118 [2023-11-26 11:48:24,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2023-11-26 11:48:24,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-26 11:48:24,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2023-11-26 11:48:25,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:25,556 INFO L349 Elim1Store]: treesize reduction 286, result has 19.4 percent of original size [2023-11-26 11:48:25,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1054 treesize of output 1005 [2023-11-26 11:48:25,766 INFO L349 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2023-11-26 11:48:25,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 336 [2023-11-26 11:48:25,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:25,827 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 17 treesize of output 11 [2023-11-26 11:48:25,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 179 [2023-11-26 11:48:26,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:26,666 INFO L349 Elim1Store]: treesize reduction 286, result has 19.4 percent of original size [2023-11-26 11:48:26,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1034 treesize of output 985 [2023-11-26 11:48:26,886 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-26 11:48:26,887 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 296 [2023-11-26 11:48:26,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:26,907 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 17 treesize of output 11 [2023-11-26 11:48:27,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 168 [2023-11-26 11:48:27,524 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse7 (= 3 (select .cse6 4))) (.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| 3) 4) 4)) (.cse13 (select .cse6 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (or (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 Int) (v_prenex_163 Int) (v_DerPreprocessor_10 Int)) (let ((.cse5 (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_19) v_DerPreprocessor_18 v_DerPreprocessor_20) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_21) 3 .cse6))) (let ((.cse1 (select .cse5 v_DerPreprocessor_10)) (.cse0 (+ v_prenex_163 4))) (let ((.cse3 (select (store .cse1 .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (let ((.cse2 (select .cse5 .cse3))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse0) 4) (= .cse1 v_DerPreprocessor_19) (= v_DerPreprocessor_20 .cse2) (= (select |c_#memory_$Pointer$#1.base| .cse3) .cse2) (not (= v_DerPreprocessor_10 3)) (= v_DerPreprocessor_18 .cse3) (= .cse4 (select .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)))))))) .cse7) (and .cse8 (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse11 (select (select .cse10 3) 0))) (let ((.cse12 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse9 (store (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse10 .cse11) (store (select |c_#memory_$Pointer$#1.base| .cse11) (+ 4 v_arrayElimCell_71) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_16 (store .cse12 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse10 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse11) (= (store .cse12 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse11) (= (select .cse9 .cse11) v_DerPreprocessor_14))))))) (and (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse16 (select (select .cse15 3) 0))) (let ((.cse17 (+ 4 v_arrayElimCell_71)) (.cse18 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse14 (store (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse15 .cse16) (store (select |c_#memory_$Pointer$#1.base| .cse16) .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_16 (store .cse18 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) .cse17) 4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse16) (= (store .cse18 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse16) (= (select .cse14 .cse16) v_DerPreprocessor_14)))))) .cse8) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse19 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse23 (select .cse21 3))) (let ((.cse22 (select .cse23 0))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.base| .cse22 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select (select .cse21 .cse22) (+ 4 v_arrayElimCell_71))) (= v_DerPreprocessor_11 (select .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse23 4) 3) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse22) (= v_DerPreprocessor_10 .cse22) (= (select .cse20 .cse22) v_DerPreprocessor_14))))))))) (= (store .cse19 0 .cse13) .cse6)))) (and (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_23) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_24) 3 .cse6)) (.cse25 (+ 4 v_arrayElimCell_71))) (and (= (select .cse24 v_DerPreprocessor_10) (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10)) (= 4 (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse25)) (not (= v_DerPreprocessor_10 3)) (= (select .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)) (not (= .cse25 0))))) .cse7) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse26 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse30 (select .cse28 3))) (let ((.cse29 (select .cse30 0))) (let ((.cse27 (store (store (store |c_#memory_$Pointer$#1.base| .cse29 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse28 .cse29) (store (select |c_#memory_$Pointer$#1.base| .cse29) (+ 4 v_arrayElimCell_71) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_11 (select .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse30 4) 3) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse29) (= v_DerPreprocessor_10 .cse29) (= (select .cse27 .cse29) v_DerPreprocessor_14))))))))) (= (store .cse26 0 .cse13) .cse6)))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse31 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse36 (select .cse33 3))) (let ((.cse34 (select .cse36 0))) (let ((.cse35 (+ 4 v_arrayElimCell_71)) (.cse32 (store (store (store |c_#memory_$Pointer$#1.base| .cse34 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse32 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse33 .cse34) (store (select |c_#memory_$Pointer$#1.base| .cse34) .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_11 (select .cse33 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse36 4) 3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse34) .cse35) 4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse34) (= v_DerPreprocessor_10 .cse34) (= (select .cse32 .cse34) v_DerPreprocessor_14))))))))) (= (store .cse31 0 .cse13) .cse6)))) (and .cse8 (or (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimCell_71 Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_10 Int)) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_28) v_DerPreprocessor_27 v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_30) 3 .cse6))) (let ((.cse37 (select .cse41 v_DerPreprocessor_10)) (.cse40 (+ 4 v_arrayElimCell_71))) (let ((.cse39 (select (store .cse37 .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (let ((.cse38 (select .cse41 .cse39))) (and (= v_DerPreprocessor_28 .cse37) (= v_DerPreprocessor_29 .cse38) (= v_DerPreprocessor_27 .cse39) (= .cse38 (select |c_#memory_$Pointer$#1.base| .cse39)) (= 4 (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse40)) (not (= v_DerPreprocessor_10 3)) (= (select .cse41 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)))))))) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_165 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_10 Int)) (let ((.cse43 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_33) 3 .cse6)) (.cse42 (+ v_prenex_165 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse42) 4) (= .cse4 (select .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10) (select .cse43 v_DerPreprocessor_10)) (not (= .cse42 0)) (not (= v_DerPreprocessor_10 3)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10))))))) (and .cse8 (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse46 (select (select .cse45 3) 0))) (let ((.cse47 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse44 (store (store (store |c_#memory_$Pointer$#1.base| .cse46 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse44 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select (select .cse45 .cse46) (+ 4 v_arrayElimCell_71))) (= v_DerPreprocessor_16 (store .cse47 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse45 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse46) (= (store .cse47 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse46) (= (select .cse44 .cse46) v_DerPreprocessor_14)))))))))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3))) is different from true [2023-11-26 11:48:27,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:48:34,167 WARN L293 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 1291 DAG size of output: 237 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-26 11:48:34,168 INFO L349 Elim1Store]: treesize reduction 3857, result has 13.2 percent of original size [2023-11-26 11:48:34,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 1 disjoint index pairs (out of 276 index pairs), introduced 26 new quantified variables, introduced 297 case distinctions, treesize of input 872873 treesize of output 682291