./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/tree-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:40:43,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:40:43,599 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:40:43,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:40:43,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:40:43,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:40:43,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:40:43,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:40:43,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:40:43,626 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:40:43,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:40:43,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:40:43,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:40:43,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:40:43,629 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:40:43,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:40:43,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:40:43,630 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:40:43,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:40:43,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:40:43,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:40:43,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:40:43,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:40:43,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:40:43,636 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:40:43,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:40:43,637 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:40:43,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:40:43,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:40:43,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:40:43,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:40:43,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:40:43,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:40:43,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:40:43,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:40:43,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:40:43,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:40:43,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:40:43,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:40:43,642 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:40:43,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:40:43,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:40:43,642 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_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2023-11-29 05:40:43,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:40:43,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:40:43,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:40:43,922 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:40:43,923 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:40:43,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/heap-manipulation/tree-2.i [2023-11-29 05:40:46,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:40:46,825 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:40:46,826 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/sv-benchmarks/c/heap-manipulation/tree-2.i [2023-11-29 05:40:46,839 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/data/d4856f45d/6ca49b372d174ef8b4ca316f4e7b6336/FLAGa8d314b3e [2023-11-29 05:40:46,851 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/data/d4856f45d/6ca49b372d174ef8b4ca316f4e7b6336 [2023-11-29 05:40:46,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:40:46,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:40:46,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:40:46,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:40:46,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:40:46,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:40:46" (1/1) ... [2023-11-29 05:40:46,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4236970c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:46, skipping insertion in model container [2023-11-29 05:40:46,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:40:46" (1/1) ... [2023-11-29 05:40:46,904 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:40:47,143 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_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2023-11-29 05:40:47,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:40:47,175 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:40:47,206 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_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2023-11-29 05:40:47,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:40:47,243 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:40:47,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47 WrapperNode [2023-11-29 05:40:47,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:40:47,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:40:47,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:40:47,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:40:47,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,290 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-11-29 05:40:47,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:40:47,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:40:47,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:40:47,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:40:47,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,324 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2023-11-29 05:40:47,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:40:47,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:40:47,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:40:47,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:40:47,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (1/1) ... [2023-11-29 05:40:47,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:40:47,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:40:47,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:40:47,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:40:47,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:40:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:40:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-29 05:40:47,409 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-29 05:40:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:40:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:40:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:40:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:40:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:40:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:40:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:40:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:40:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:40:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:40:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:40:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:40:47,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:40:47,538 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:40:47,540 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:40:47,763 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:40:47,785 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:40:47,785 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-29 05:40:47,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:40:47 BoogieIcfgContainer [2023-11-29 05:40:47,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:40:47,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:40:47,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:40:47,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:40:47,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:40:46" (1/3) ... [2023-11-29 05:40:47,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7244dd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:40:47, skipping insertion in model container [2023-11-29 05:40:47,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:47" (2/3) ... [2023-11-29 05:40:47,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7244dd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:40:47, skipping insertion in model container [2023-11-29 05:40:47,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:40:47" (3/3) ... [2023-11-29 05:40:47,794 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-2.i [2023-11-29 05:40:47,808 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:40:47,808 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:40:47,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:40:47,855 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;@7444533a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:40:47,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:40:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 38 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:40:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 05:40:47,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:47,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:47,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:47,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash 998848705, now seen corresponding path program 1 times [2023-11-29 05:40:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:47,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241805555] [2023-11-29 05:40:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:47,986 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-29 05:40:47,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:47,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241805555] [2023-11-29 05:40:47,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241805555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:47,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:47,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:40:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827244154] [2023-11-29 05:40:47,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:47,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:40:47,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:48,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:40:48,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:40:48,019 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 38 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:48,048 INFO L93 Difference]: Finished difference Result 78 states and 135 transitions. [2023-11-29 05:40:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:40:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 05:40:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:48,055 INFO L225 Difference]: With dead ends: 78 [2023-11-29 05:40:48,056 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 05:40:48,058 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-29 05:40:48,061 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:48,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:40:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 05:40:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 05:40:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-29 05:40:48,095 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2023-11-29 05:40:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:48,095 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-29 05:40:48,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-29 05:40:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:40:48,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:48,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:48,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:40:48,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:48,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1273352452, now seen corresponding path program 1 times [2023-11-29 05:40:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508267511] [2023-11-29 05:40:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:48,283 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-29 05:40:48,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:48,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508267511] [2023-11-29 05:40:48,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508267511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:48,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:48,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:40:48,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803573853] [2023-11-29 05:40:48,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:48,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:40:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:48,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:40:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:40:48,288 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:48,321 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2023-11-29 05:40:48,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:40:48,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 05:40:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:48,323 INFO L225 Difference]: With dead ends: 66 [2023-11-29 05:40:48,323 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 05:40:48,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:40:48,325 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:48,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 87 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:40:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 05:40:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-11-29 05:40:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-29 05:40:48,332 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 9 [2023-11-29 05:40:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:48,333 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 05:40:48,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-29 05:40:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 05:40:48,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:48,334 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:48,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:40:48,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:48,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1339478189, now seen corresponding path program 1 times [2023-11-29 05:40:48,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:48,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758981986] [2023-11-29 05:40:48,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:48,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:40:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:48,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758981986] [2023-11-29 05:40:48,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758981986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:48,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:48,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:40:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726979230] [2023-11-29 05:40:48,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:48,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:40:48,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:48,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:40:48,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:40:48,417 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:48,483 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2023-11-29 05:40:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:40:48,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 05:40:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:48,484 INFO L225 Difference]: With dead ends: 54 [2023-11-29 05:40:48,484 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 05:40:48,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:40:48,486 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:48,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:40:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 05:40:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2023-11-29 05:40:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-11-29 05:40:48,493 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 15 [2023-11-29 05:40:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:48,493 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-11-29 05:40:48,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-11-29 05:40:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 05:40:48,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:48,494 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:48,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:40:48,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:48,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash -555375573, now seen corresponding path program 1 times [2023-11-29 05:40:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:48,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411575347] [2023-11-29 05:40:48,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:48,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:40:48,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411575347] [2023-11-29 05:40:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411575347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:48,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:48,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:40:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015269596] [2023-11-29 05:40:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:48,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:40:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:40:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:40:48,696 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:48,858 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2023-11-29 05:40:48,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:40:48,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-29 05:40:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:48,859 INFO L225 Difference]: With dead ends: 75 [2023-11-29 05:40:48,859 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 05:40:48,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:40:48,861 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:48,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 74 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:40:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 05:40:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2023-11-29 05:40:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 2 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-29 05:40:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-11-29 05:40:48,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2023-11-29 05:40:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:48,869 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-11-29 05:40:48,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:40:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-11-29 05:40:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:40:48,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:48,870 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:48,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:40:48,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:48,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2052226649, now seen corresponding path program 1 times [2023-11-29 05:40:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:48,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221530921] [2023-11-29 05:40:48,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:48,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:40:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221530921] [2023-11-29 05:40:50,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221530921] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:40:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319867742] [2023-11-29 05:40:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:50,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:40:50,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:40:50,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:40:50,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:40:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:50,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-29 05:40:50,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:40:50,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:40:50,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:40:50,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:40:50,921 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:40:50,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 05:40:51,054 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2023-11-29 05:40:51,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 7828 treesize of output 5912 [2023-11-29 05:40:51,118 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2023-11-29 05:40:51,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 8656 treesize of output 6484 [2023-11-29 05:40:51,172 INFO L349 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2023-11-29 05:40:51,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 5699 treesize of output 4468 [2023-11-29 05:40:51,230 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2023-11-29 05:40:51,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 5116 treesize of output 3955 [2023-11-29 05:40:51,271 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-11-29 05:40:51,271 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 129 [2023-11-29 05:40:51,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:40:51,281 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 72 treesize of output 53 [2023-11-29 05:40:51,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-29 05:40:51,354 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2023-11-29 05:40:51,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 7031 treesize of output 5458 [2023-11-29 05:40:51,402 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2023-11-29 05:40:51,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 7583 treesize of output 5842 [2023-11-29 05:40:51,451 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2023-11-29 05:40:51,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 4902 treesize of output 1 [2023-11-29 05:40:51,492 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2023-11-29 05:40:51,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 6644 treesize of output 5169 [2023-11-29 05:40:51,540 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2023-11-29 05:40:51,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 7196 treesize of output 5553 [2023-11-29 05:40:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:40:51,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:40:51,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:40:51,911 INFO L349 Elim1Store]: treesize reduction 1196, result has 53.7 percent of original size [2023-11-29 05:40:51,912 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 2 case distinctions, treesize of input 3943 treesize of output 4584 [2023-11-29 05:40:51,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:40:51,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1867 treesize of output 2090 [2023-11-29 05:40:52,039 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 1689 treesize of output 1397 [2023-11-29 05:40:52,095 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 134 treesize of output 4 [2023-11-29 05:40:52,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:40:52,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2860 treesize of output 3574 [2023-11-29 05:40:53,698 INFO L349 Elim1Store]: treesize reduction 1196, result has 53.7 percent of original size [2023-11-29 05:40:53,699 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 2 case distinctions, treesize of input 2169 treesize of output 2810 [2023-11-29 05:40:53,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:40:53,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1867 treesize of output 1818 [2023-11-29 05:40:53,797 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 296 treesize of output 4 [2023-11-29 05:40:53,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:40:53,861 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 1705 treesize of output 1705 [2023-11-29 05:40:56,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse64 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse65 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse64 (store (select |c_#memory_$Pointer$#1.base| .cse64) .cse65 0)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse4 (let ((.cse63 (store |c_#memory_$Pointer$#1.offset| .cse64 (store (select |c_#memory_$Pointer$#1.offset| .cse64) .cse65 0)))) (store .cse63 .cse8 (store (select .cse63 .cse8) (+ (select (select .cse63 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) 4) 0))))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (and (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse1 (store .cse6 .cse5 v_ArrVal_181))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_174 (Array Int Int))) (not (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_174) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 .cse5 v_prenex_2) .cse0 v_prenex_1) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse3) (= (select (select (store (store .cse4 .cse5 v_ArrVal_178) .cse0 v_ArrVal_179) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse3)))) (= .cse0 .cse5))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse13 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_181))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse4 .cse10 v_ArrVal_178) .cse11 v_ArrVal_179) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse9 .cse2) (= .cse9 (select (select (store (store .cse4 .cse10 v_prenex_2) .cse11 v_prenex_1) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))))) (forall ((v_ArrVal_174 (Array Int Int))) (= .cse11 (select (select (store .cse12 .cse11 v_ArrVal_174) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse11 .cse10))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse17 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_181))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse2 (select (select (store (store .cse4 .cse14 v_prenex_2) .cse15 v_prenex_1) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (= (select (select (store (store .cse4 .cse14 v_ArrVal_178) .cse15 v_ArrVal_179) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (forall ((v_ArrVal_174 (Array Int Int))) (= .cse15 (select (select (store .cse16 .cse15 v_ArrVal_174) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (= .cse15 .cse14))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse21 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse18 (store .cse21 .cse20 v_ArrVal_181))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_174 (Array Int Int))) (not (= (select (select (store .cse18 .cse19 v_ArrVal_174) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse20))) (= .cse19 .cse20))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse25 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse22 (store .cse25 .cse24 v_ArrVal_181))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_174 (Array Int Int))) (= (select (select (store .cse22 .cse23 v_ArrVal_174) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse24)) (= .cse23 .cse24))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse31 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse28 (select (select .cse31 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse27 (store .cse31 .cse28 v_ArrVal_181))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_174 (Array Int Int))) (not (= .cse26 (select (select (store .cse27 .cse26 v_ArrVal_174) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse30 (store .cse4 .cse28 v_prenex_2))) (let ((.cse29 (select (select (store .cse30 .cse26 v_prenex_1) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= (select (select (store (store .cse4 .cse28 v_ArrVal_178) .cse26 v_ArrVal_179) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse29) (not (= (select (select .cse30 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse29 4))))))) (= .cse26 .cse28))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse35 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse33 (select (select .cse35 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse32 (select (select (store .cse35 .cse33 v_ArrVal_181) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (not (= .cse32 .cse33)) (forall ((v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (not (let ((.cse34 (store .cse4 .cse33 v_ArrVal_178))) (= (select (select .cse34 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ (select (select (store .cse34 .cse32 v_ArrVal_179) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) 4)))))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse38 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse36 (select (select .cse38 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse37 (select (select (store .cse38 .cse36 v_ArrVal_181) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (= (select (select (store (store .cse4 .cse36 v_ArrVal_178) .cse37 v_ArrVal_179) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2)) (not (= .cse37 .cse36))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse42 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse39 (select (select .cse42 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse41 (store .cse42 .cse39 v_ArrVal_181))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (= .cse2 (select (select (store (store .cse4 .cse39 v_prenex_2) .cse40 v_prenex_1) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)) (forall ((v_ArrVal_174 (Array Int Int))) (not (= .cse40 (select (select (store .cse41 .cse40 v_ArrVal_174) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= (select (select (store (store .cse4 .cse39 v_ArrVal_178) .cse40 v_ArrVal_179) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) .cse2) (= .cse40 .cse39))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse47 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse45 (select (select .cse47 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse46 (store .cse47 .cse45 v_ArrVal_181))) (let ((.cse44 (select (select .cse46 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (not (let ((.cse43 (store .cse4 .cse45 v_prenex_2))) (= (select (select .cse43 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ (select (select (store .cse43 .cse44 v_prenex_1) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) 4))))) (forall ((v_ArrVal_174 (Array Int Int))) (not (= .cse44 (select (select (store .cse46 .cse44 v_ArrVal_174) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|)))) (= .cse44 .cse45))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse51 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse49 (store .cse51 .cse50 v_ArrVal_181))) (let ((.cse48 (select (select .cse49 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_174 (Array Int Int))) (= .cse48 (select (select (store .cse49 .cse48 v_ArrVal_174) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (not (= .cse48 .cse50)))))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse57 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse56 (select (select .cse57 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse55 (select (select (store .cse57 .cse56 v_ArrVal_181) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse52 (select (select (store (store .cse4 .cse56 v_ArrVal_178) .cse55 v_ArrVal_179) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse52 .cse2) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse54 (store .cse4 .cse56 v_prenex_2))) (let ((.cse53 (select (select (store .cse54 .cse55 v_prenex_1) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse52 .cse53) (not (= (select (select .cse54 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) (+ .cse53 4)))))))))) (= .cse55 .cse56)))))) (forall ((v_ArrVal_181 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse62 (store .cse7 .cse8 v_ArrVal_172))) (let ((.cse60 (select (select .cse62 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse61 (select (select (store .cse62 .cse60 v_ArrVal_181) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (or (forall ((v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse58 (select (select (store (store .cse4 .cse60 v_ArrVal_178) .cse61 v_ArrVal_179) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse58 .cse2) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse59 (select (select (store (store .cse4 .cse60 v_prenex_2) .cse61 v_prenex_1) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|))) (or (= .cse2 .cse59) (= .cse58 .cse59))))))) (= .cse61 .cse60)))))))))))) is different from false [2023-11-29 05:40:57,165 INFO L349 Elim1Store]: treesize reduction 142, result has 27.2 percent of original size [2023-11-29 05:40:57,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 13627 treesize of output 10544 [2023-11-29 05:40:58,170 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2023-11-29 05:40:58,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 9688 treesize of output 4392 [2023-11-29 05:41:01,237 INFO L349 Elim1Store]: treesize reduction 56, result has 48.1 percent of original size [2023-11-29 05:41:01,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 88893 treesize of output 81762 [2023-11-29 05:41:06,911 INFO L349 Elim1Store]: treesize reduction 41, result has 77.1 percent of original size [2023-11-29 05:41:06,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 51936 treesize of output 50057 [2023-11-29 05:41:09,127 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 28392 treesize of output 28318 [2023-11-29 05:41:09,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:09,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28318 treesize of output 28269 [2023-11-29 05:41:11,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:11,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69790 treesize of output 64038 [2023-11-29 05:41:13,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:13,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31979 treesize of output 31808 [2023-11-29 05:41:14,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:14,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31783 treesize of output 31568 [2023-11-29 05:41:15,323 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 31543 treesize of output 31515 [2023-11-29 05:41:16,198 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 31515 treesize of output 31505 [2023-11-29 05:41:17,024 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 31505 treesize of output 31451 [2023-11-29 05:41:17,999 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 31451 treesize of output 31415 [2023-11-29 05:41:18,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:19,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31415 treesize of output 31402 [2023-11-29 05:41:20,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:20,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31377 treesize of output 31288 [2023-11-29 05:41:20,986 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 31263 treesize of output 31117 [2023-11-29 05:41:21,953 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 31117 treesize of output 31089 [2023-11-29 05:41:22,910 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 31089 treesize of output 31079 [2023-11-29 05:41:23,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:23,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31079 treesize of output 30886 [2023-11-29 05:41:25,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:25,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30861 treesize of output 30814 [2023-11-29 05:41:26,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:26,177 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 30789 treesize of output 30730 [2023-11-29 05:41:27,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:27,318 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 30721 treesize of output 30616 [2023-11-29 05:41:28,371 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 30607 treesize of output 30595 [2023-11-29 05:41:29,443 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 30595 treesize of output 30563 [2023-11-29 05:41:30,480 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 30563 treesize of output 30515 [2023-11-29 05:41:31,548 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 30515 treesize of output 30495 [2023-11-29 05:41:32,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:32,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30495 treesize of output 30488 [2023-11-29 05:41:33,779 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 30463 treesize of output 30407 [2023-11-29 05:41:34,862 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 30407 treesize of output 30387 [2023-11-29 05:41:35,942 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 30387 treesize of output 30377 [2023-11-29 05:41:37,047 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 30377 treesize of output 30349 [2023-11-29 05:41:38,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:38,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30349 treesize of output 29810 [2023-11-29 05:41:39,340 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 29785 treesize of output 29671 [2023-11-29 05:41:40,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:40,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29671 treesize of output 29344 [2023-11-29 05:41:41,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:41,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29319 treesize of output 29226 [2023-11-29 05:41:43,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:43,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29201 treesize of output 29076 [2023-11-29 05:41:44,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:44,436 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 29051 treesize of output 29026 [2023-11-29 05:41:45,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:45,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29017 treesize of output 28708 [2023-11-29 05:41:47,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:47,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28683 treesize of output 28446 [2023-11-29 05:41:48,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:48,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28421 treesize of output 28048 [2023-11-29 05:41:49,903 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 28023 treesize of output 27921 [2023-11-29 05:41:51,273 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 27921 treesize of output 27905 [2023-11-29 05:41:52,612 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 27905 treesize of output 27899 [2023-11-29 05:41:53,957 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 27899 treesize of output 27883 [2023-11-29 05:41:55,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:55,366 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 27883 treesize of output 27842 [2023-11-29 05:41:56,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:56,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27833 treesize of output 27710 [2023-11-29 05:41:58,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:41:58,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27685 treesize of output 27530 [2023-11-29 05:41:59,774 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 27505 treesize of output 27469 [2023-11-29 05:42:01,212 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 27469 treesize of output 27463 [2023-11-29 05:42:02,648 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 27463 treesize of output 27447 [2023-11-29 05:42:04,081 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 27447 treesize of output 27431 [2023-11-29 05:42:05,522 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 27431 treesize of output 27425 [2023-11-29 05:42:06,954 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 27425 treesize of output 27355 [2023-11-29 05:42:08,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:08,470 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 27355 treesize of output 27324 [2023-11-29 05:42:09,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:09,977 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 27315 treesize of output 27258 [2023-11-29 05:42:11,458 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 27249 treesize of output 27243 [2023-11-29 05:42:12,908 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 27243 treesize of output 27227 [2023-11-29 05:42:14,347 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 27227 treesize of output 27195 [2023-11-29 05:42:15,778 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 27195 treesize of output 27183 [2023-11-29 05:42:17,224 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 27183 treesize of output 27177 [2023-11-29 05:42:18,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:18,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27177 treesize of output 27082 [2023-11-29 05:42:20,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:20,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27057 treesize of output 26978 [2023-11-29 05:42:21,949 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 26953 treesize of output 26919 [2023-11-29 05:42:23,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26919 treesize of output 26873 [2023-11-29 05:42:25,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:25,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26873 treesize of output 26834 [2023-11-29 05:42:26,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:26,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26809 treesize of output 26640 [2023-11-29 05:42:28,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:28,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26615 treesize of output 26448 [2023-11-29 05:42:30,146 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 26423 treesize of output 26369 [2023-11-29 05:42:31,788 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 26369 treesize of output 26349 [2023-11-29 05:42:33,434 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 26349 treesize of output 26293 [2023-11-29 05:42:35,059 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 26293 treesize of output 26237 [2023-11-29 05:42:36,703 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 26237 treesize of output 26217 [2023-11-29 05:42:38,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:38,393 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 26217 treesize of output 26056 [2023-11-29 05:42:40,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:42:40,074 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 26047 treesize of output 25950 [2023-11-29 05:50:26,068 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 05:50:26,070 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 05:50:26,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-11-29 05:50:26,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 05:50:26,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:26,271 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 61 more [2023-11-29 05:50:26,274 INFO L158 Benchmark]: Toolchain (without parser) took 579419.54ms. Allocated memory was 155.2MB in the beginning and 813.7MB in the end (delta: 658.5MB). Free memory was 116.8MB in the beginning and 324.2MB in the end (delta: -207.4MB). Peak memory consumption was 491.5MB. Max. memory is 16.1GB. [2023-11-29 05:50:26,274 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:50:26,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.33ms. Allocated memory is still 155.2MB. Free memory was 116.8MB in the beginning and 99.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 05:50:26,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.27ms. Allocated memory is still 155.2MB. Free memory was 99.5MB in the beginning and 96.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:50:26,275 INFO L158 Benchmark]: Boogie Preprocessor took 55.16ms. Allocated memory is still 155.2MB. Free memory was 96.9MB in the beginning and 93.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:50:26,275 INFO L158 Benchmark]: RCFGBuilder took 438.90ms. Allocated memory is still 155.2MB. Free memory was 93.8MB in the beginning and 74.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 05:50:26,275 INFO L158 Benchmark]: TraceAbstraction took 578484.86ms. Allocated memory was 155.2MB in the beginning and 813.7MB in the end (delta: 658.5MB). Free memory was 73.8MB in the beginning and 324.2MB in the end (delta: -250.4MB). Peak memory consumption was 449.6MB. Max. memory is 16.1GB. [2023-11-29 05:50:26,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.33ms. Allocated memory is still 155.2MB. Free memory was 116.8MB in the beginning and 99.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.27ms. Allocated memory is still 155.2MB. Free memory was 99.5MB in the beginning and 96.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.16ms. Allocated memory is still 155.2MB. Free memory was 96.9MB in the beginning and 93.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 438.90ms. Allocated memory is still 155.2MB. Free memory was 93.8MB in the beginning and 74.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 578484.86ms. Allocated memory was 155.2MB in the beginning and 813.7MB in the end (delta: 658.5MB). Free memory was 73.8MB in the beginning and 324.2MB in the end (delta: -250.4MB). Peak memory consumption was 449.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:50:27,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:50:28,050 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:50:28,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:50:28,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:50:28,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:50:28,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:50:28,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:50:28,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:50:28,088 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:50:28,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:50:28,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:50:28,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:50:28,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:50:28,091 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:50:28,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:50:28,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:50:28,093 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:50:28,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:50:28,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:50:28,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:50:28,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:50:28,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:50:28,096 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:50:28,097 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:50:28,097 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:50:28,098 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:50:28,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:50:28,098 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:50:28,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:50:28,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:50:28,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:50:28,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:50:28,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:50:28,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:50:28,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:50:28,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:50:28,101 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:50:28,102 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:50:28,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:50:28,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:50:28,102 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:50:28,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:50:28,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:50:28,103 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:50:28,103 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_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2023-11-29 05:50:28,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:50:28,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:50:28,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:50:28,438 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:50:28,438 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:50:28,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/heap-manipulation/tree-2.i [2023-11-29 05:50:31,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:50:31,389 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:50:31,389 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/sv-benchmarks/c/heap-manipulation/tree-2.i [2023-11-29 05:50:31,405 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/data/50996dc21/a7e6813d60ef4780a3a20bdebded8f5d/FLAG9719a06dd [2023-11-29 05:50:31,417 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/data/50996dc21/a7e6813d60ef4780a3a20bdebded8f5d [2023-11-29 05:50:31,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:50:31,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:50:31,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:50:31,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:50:31,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:50:31,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156b5f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31, skipping insertion in model container [2023-11-29 05:50:31,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,469 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:50:31,716 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_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2023-11-29 05:50:31,742 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:50:31,763 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:50:31,801 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_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2023-11-29 05:50:31,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:50:31,843 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:50:31,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31 WrapperNode [2023-11-29 05:50:31,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:50:31,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:50:31,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:50:31,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:50:31,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,896 INFO L138 Inliner]: procedures = 125, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-11-29 05:50:31,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:50:31,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:50:31,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:50:31,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:50:31,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,933 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2023-11-29 05:50:31,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:50:31,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:50:31,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:50:31,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:50:31,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (1/1) ... [2023-11-29 05:50:31,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:50:31,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:31,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:50:31,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:50:32,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 05:50:32,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 05:50:32,025 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-29 05:50:32,025 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-29 05:50:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:50:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:50:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:50:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:50:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:50:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:50:32,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:50:32,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:50:32,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:50:32,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:50:32,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:50:32,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:50:32,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:50:32,165 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:50:32,167 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:50:32,682 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:50:32,704 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:50:32,704 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-29 05:50:32,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:32 BoogieIcfgContainer [2023-11-29 05:50:32,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:50:32,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:50:32,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:50:32,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:50:32,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:50:31" (1/3) ... [2023-11-29 05:50:32,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca7942a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:50:32, skipping insertion in model container [2023-11-29 05:50:32,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:31" (2/3) ... [2023-11-29 05:50:32,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca7942a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:50:32, skipping insertion in model container [2023-11-29 05:50:32,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:32" (3/3) ... [2023-11-29 05:50:32,714 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-2.i [2023-11-29 05:50:32,733 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:50:32,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:50:32,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:50:32,789 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;@7a43916a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:50:32,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:50:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 38 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:50:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 05:50:32,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:32,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:32,802 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:32,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash 998848705, now seen corresponding path program 1 times [2023-11-29 05:50:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:50:32,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492827151] [2023-11-29 05:50:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:32,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:32,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:50:32,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:50:32,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:50:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:32,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:50:32,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:32,935 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-29 05:50:32,936 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:32,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:50:32,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492827151] [2023-11-29 05:50:32,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492827151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:32,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:32,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639693326] [2023-11-29 05:50:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:32,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:50:32,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:50:32,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:50:32,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:50:32,981 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 38 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:33,019 INFO L93 Difference]: Finished difference Result 78 states and 135 transitions. [2023-11-29 05:50:33,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:50:33,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 05:50:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:33,030 INFO L225 Difference]: With dead ends: 78 [2023-11-29 05:50:33,030 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 05:50:33,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:50:33,038 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:33,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:50:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 05:50:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 05:50:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-29 05:50:33,091 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2023-11-29 05:50:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:33,092 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-29 05:50:33,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-29 05:50:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:50:33,093 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:33,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:33,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:50:33,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:33,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:33,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1273352452, now seen corresponding path program 1 times [2023-11-29 05:50:33,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:50:33,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782092721] [2023-11-29 05:50:33,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:33,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:33,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:50:33,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:50:33,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:50:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:33,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:50:33,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:33,486 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-29 05:50:33,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:33,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:50:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782092721] [2023-11-29 05:50:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782092721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:33,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:50:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018268173] [2023-11-29 05:50:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:33,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:50:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:50:33,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:50:33,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:50:33,491 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:33,578 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2023-11-29 05:50:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:50:33,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 05:50:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:33,579 INFO L225 Difference]: With dead ends: 66 [2023-11-29 05:50:33,579 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 05:50:33,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:50:33,581 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:33,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 87 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:50:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 05:50:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-11-29 05:50:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-29 05:50:33,589 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 9 [2023-11-29 05:50:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:33,589 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 05:50:33,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-29 05:50:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 05:50:33,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:33,591 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:33,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:50:33,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:33,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:33,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1339478189, now seen corresponding path program 1 times [2023-11-29 05:50:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:50:33,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951915494] [2023-11-29 05:50:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:50:33,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:50:33,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:50:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:33,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:50:33,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:33,902 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:33,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:50:33,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951915494] [2023-11-29 05:50:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951915494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:33,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:33,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:50:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744743319] [2023-11-29 05:50:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:33,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:50:33,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:33,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:33,906 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:35,178 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2023-11-29 05:50:35,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:35,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 05:50:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:35,180 INFO L225 Difference]: With dead ends: 54 [2023-11-29 05:50:35,180 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 05:50:35,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:35,182 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:35,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 05:50:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 05:50:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2023-11-29 05:50:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-11-29 05:50:35,189 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 15 [2023-11-29 05:50:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:35,189 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-11-29 05:50:35,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-11-29 05:50:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 05:50:35,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:35,199 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:35,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 05:50:35,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:35,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:35,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash -555375573, now seen corresponding path program 1 times [2023-11-29 05:50:35,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:50:35,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395981145] [2023-11-29 05:50:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:35,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:35,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:50:35,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:50:35,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:50:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:35,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:50:35,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:50:35,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:35,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:50:35,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395981145] [2023-11-29 05:50:35,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395981145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:35,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:35,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:50:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077572554] [2023-11-29 05:50:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:35,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:50:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:50:35,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:50:35,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:50:35,628 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:37,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:38,400 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2023-11-29 05:50:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:50:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-29 05:50:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:38,402 INFO L225 Difference]: With dead ends: 75 [2023-11-29 05:50:38,402 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 05:50:38,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:50:38,404 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:38,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 74 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 05:50:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 05:50:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2023-11-29 05:50:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 2 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-29 05:50:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-11-29 05:50:38,412 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2023-11-29 05:50:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:38,413 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-11-29 05:50:38,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-11-29 05:50:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:50:38,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:38,414 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:38,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:50:38,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:38,615 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:38,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2052226649, now seen corresponding path program 1 times [2023-11-29 05:50:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:50:38,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813325586] [2023-11-29 05:50:38,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:38,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:38,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:50:38,617 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:50:38,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee3f1ff2-c787-42bf-9e32-9e04ec9e4871/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:50:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:38,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 05:50:38,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:38,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:50:39,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:50:39,098 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 05:50:39,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 05:50:39,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:50:39,310 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2023-11-29 05:50:39,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 4765 treesize of output 3636 [2023-11-29 05:50:39,387 INFO L349 Elim1Store]: treesize reduction 385, result has 0.3 percent of original size [2023-11-29 05:50:39,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 4454 treesize of output 3447 [2023-11-29 05:50:39,434 INFO L349 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2023-11-29 05:50:39,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 2911 treesize of output 2275 [2023-11-29 05:50:39,501 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2023-11-29 05:50:39,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 5957 treesize of output 4578 [2023-11-29 05:50:39,553 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2023-11-29 05:50:39,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 5510 treesize of output 4267 [2023-11-29 05:50:39,702 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2023-11-29 05:50:39,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 2474 treesize of output 1828 [2023-11-29 05:50:39,832 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-11-29 05:50:39,833 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 129 [2023-11-29 05:50:39,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:50:39,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2023-11-29 05:50:39,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-29 05:50:39,924 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2023-11-29 05:50:39,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 5897 treesize of output 4556 [2023-11-29 05:50:39,996 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2023-11-29 05:50:39,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 6344 treesize of output 4867 [2023-11-29 05:50:40,151 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2023-11-29 05:50:40,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 2577 treesize of output 1 [2023-11-29 05:50:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:40,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:41,300 INFO L349 Elim1Store]: treesize reduction 1196, result has 53.7 percent of original size [2023-11-29 05:50:41,301 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 2 case distinctions, treesize of input 4285 treesize of output 4688 [2023-11-29 05:50:41,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:41,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4688 treesize of output 4968 [2023-11-29 05:50:41,687 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 1689 treesize of output 1397 [2023-11-29 05:50:42,420 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 134 treesize of output 4 [2023-11-29 05:50:44,823 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 1248 treesize of output 956 [2023-11-29 05:50:44,916 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 134 treesize of output 4 [2023-11-29 05:50:45,252 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 1248 treesize of output 956 [2023-11-29 05:50:45,471 INFO L349 Elim1Store]: treesize reduction 5, result has 98.8 percent of original size [2023-11-29 05:50:45,471 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 430 treesize of output 425 [2023-11-29 05:50:45,645 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 295 treesize of output 3 [2023-11-29 05:50:45,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:45,888 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 1382 treesize of output 1382 [2023-11-29 05:50:45,945 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 295 treesize of output 3 [2023-11-29 05:50:46,259 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 295 treesize of output 3 [2023-11-29 05:50:46,267 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 134 treesize of output 4 [2023-11-29 05:50:46,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:46,449 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 1382 treesize of output 1382