./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:40:13,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:40:13,463 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:40:13,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:40:13,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:40:13,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:40:13,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:40:13,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:40:13,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:40:13,496 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:40:13,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:40:13,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:40:13,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:40:13,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:40:13,499 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:40:13,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:40:13,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:40:13,500 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:40:13,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:40:13,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:40:13,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:40:13,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:40:13,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:40:13,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:40:13,504 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:40:13,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:40:13,505 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:40:13,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:40:13,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:40:13,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:40:13,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:40:13,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:40:13,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:40:13,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:40:13,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:40:13,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:40:13,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:40:13,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:40:13,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:40:13,509 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:40:13,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:40:13,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:40:13,509 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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 -> 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 [2023-11-29 01:40:13,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:40:13,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:40:13,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:40:13,762 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:40:13,763 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:40:13,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2023-11-29 01:40:16,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:40:16,789 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:40:16,789 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2023-11-29 01:40:16,803 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/data/7dbc03515/4bd9f06f47e64bb2817083bfa43078e5/FLAG961f204a1 [2023-11-29 01:40:16,818 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/data/7dbc03515/4bd9f06f47e64bb2817083bfa43078e5 [2023-11-29 01:40:16,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:40:16,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:40:16,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:40:16,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:40:16,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:40:16,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:40:16" (1/1) ... [2023-11-29 01:40:16,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d0d348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:16, skipping insertion in model container [2023-11-29 01:40:16,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:40:16" (1/1) ... [2023-11-29 01:40:16,880 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:40:17,144 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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-29 01:40:17,149 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:40:17,158 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:40:17,193 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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-29 01:40:17,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:40:17,223 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:40:17,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17 WrapperNode [2023-11-29 01:40:17,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:40:17,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:40:17,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:40:17,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:40:17,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,266 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-11-29 01:40:17,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:40:17,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:40:17,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:40:17,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:40:17,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,296 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-11-29 01:40:17,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:40:17,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:40:17,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:40:17,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:40:17,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (1/1) ... [2023-11-29 01:40:17,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:40:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:40:17,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:40:17,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:40:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 01:40:17,379 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 01:40:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:40:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:40:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:40:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:40:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:40:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:40:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:40:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:40:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:40:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:40:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:40:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:40:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:40:17,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:40:17,479 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:40:17,482 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:40:17,529 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 01:40:17,638 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:40:17,661 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:40:17,661 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 01:40:17,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:40:17 BoogieIcfgContainer [2023-11-29 01:40:17,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:40:17,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:40:17,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:40:17,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:40:17,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:40:16" (1/3) ... [2023-11-29 01:40:17,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d59e49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:40:17, skipping insertion in model container [2023-11-29 01:40:17,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:40:17" (2/3) ... [2023-11-29 01:40:17,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d59e49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:40:17, skipping insertion in model container [2023-11-29 01:40:17,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:40:17" (3/3) ... [2023-11-29 01:40:17,671 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2023-11-29 01:40:17,686 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:40:17,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:40:17,726 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:40:17,733 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;@1b63de3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:40:17,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:40:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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 01:40:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 01:40:17,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:17,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:17,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:40:17,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:17,748 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-11-29 01:40:17,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:40:17,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836192560] [2023-11-29 01:40:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:17,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:40:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:17,894 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 01:40:17,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:40:17,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836192560] [2023-11-29 01:40:17,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836192560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:40:17,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:40:17,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:40:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059738444] [2023-11-29 01:40:17,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:40:17,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:40:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:40:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:40:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:40:17,930 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:17,951 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-29 01:40:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:40:17,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 01:40:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:17,973 INFO L225 Difference]: With dead ends: 34 [2023-11-29 01:40:17,973 INFO L226 Difference]: Without dead ends: 17 [2023-11-29 01:40:17,976 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 01:40:17,980 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:17,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:40:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-29 01:40:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-29 01:40:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-29 01:40:18,020 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-11-29 01:40:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:18,020 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-29 01:40:18,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-29 01:40:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:40:18,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:18,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:18,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:40:18,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:40:18,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-11-29 01:40:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:40:18,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369996593] [2023-11-29 01:40:18,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:40:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:18,098 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 01:40:18,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:40:18,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369996593] [2023-11-29 01:40:18,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369996593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:40:18,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:40:18,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:40:18,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772351379] [2023-11-29 01:40:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:40:18,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:40:18,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:40:18,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:40:18,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:40:18,103 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:18,120 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-29 01:40:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:40:18,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 01:40:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:18,121 INFO L225 Difference]: With dead ends: 27 [2023-11-29 01:40:18,121 INFO L226 Difference]: Without dead ends: 18 [2023-11-29 01:40:18,122 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 01:40:18,124 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:18,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:40:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-29 01:40:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-29 01:40:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-29 01:40:18,130 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-11-29 01:40:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:18,130 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-29 01:40:18,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-29 01:40:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:40:18,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:18,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:18,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:40:18,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:40:18,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2049023080, now seen corresponding path program 1 times [2023-11-29 01:40:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:40:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889854882] [2023-11-29 01:40:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:18,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:40:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:18,253 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 01:40:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:40:18,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889854882] [2023-11-29 01:40:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889854882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:40:18,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:40:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:40:18,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801073125] [2023-11-29 01:40:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:40:18,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:40:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:40:18,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:40:18,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:40:18,257 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:18,299 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-29 01:40:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:40:18,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 01:40:18,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:18,301 INFO L225 Difference]: With dead ends: 38 [2023-11-29 01:40:18,302 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 01:40:18,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:40:18,304 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:18,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:40:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 01:40:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-29 01:40:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-29 01:40:18,310 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-11-29 01:40:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:18,310 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-29 01:40:18,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-29 01:40:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 01:40:18,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:18,312 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:18,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:40:18,312 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:40:18,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-11-29 01:40:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:40:18,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130172254] [2023-11-29 01:40:18,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:40:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:40:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:40:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130172254] [2023-11-29 01:40:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130172254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:40:18,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:40:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:40:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396448572] [2023-11-29 01:40:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:40:18,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:40:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:40:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:40:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:40:18,422 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:18,463 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-11-29 01:40:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:40:18,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 01:40:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:18,464 INFO L225 Difference]: With dead ends: 31 [2023-11-29 01:40:18,464 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 01:40:18,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:40:18,466 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:18,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:40:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 01:40:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2023-11-29 01:40:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-29 01:40:18,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-11-29 01:40:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:18,473 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-29 01:40:18,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-29 01:40:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 01:40:18,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:18,474 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:18,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:40:18,474 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:40:18,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1477352526, now seen corresponding path program 1 times [2023-11-29 01:40:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:40:18,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394227364] [2023-11-29 01:40:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:40:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:40:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:40:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394227364] [2023-11-29 01:40:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394227364] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:40:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939183048] [2023-11-29 01:40:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:18,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:40:18,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:40:18,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:40:18,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:40:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:18,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:40:18,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:40:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:40:18,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:40:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:40:18,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939183048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:40:18,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:40:18,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-29 01:40:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425746129] [2023-11-29 01:40:18,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:40:18,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:40:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:40:18,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:40:18,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:40:18,781 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:18,860 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-11-29 01:40:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:40:18,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 01:40:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:18,861 INFO L225 Difference]: With dead ends: 55 [2023-11-29 01:40:18,861 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 01:40:18,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:40:18,863 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:18,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:40:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 01:40:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-11-29 01:40:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-29 01:40:18,869 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2023-11-29 01:40:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:18,870 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-29 01:40:18,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-29 01:40:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 01:40:18,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:18,871 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:18,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 01:40:19,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:40:19,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:40:19,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 2 times [2023-11-29 01:40:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:40:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869598308] [2023-11-29 01:40:19,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:40:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:40:19,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:40:19,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869598308] [2023-11-29 01:40:19,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869598308] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:40:19,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689721860] [2023-11-29 01:40:19,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:40:19,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:40:19,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:40:19,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:40:19,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:40:19,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:40:19,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:40:19,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:40:19,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:40:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:40:19,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:40:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:40:19,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689721860] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:40:19,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:40:19,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-11-29 01:40:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354747158] [2023-11-29 01:40:19,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:40:19,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:40:19,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:40:19,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:40:19,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:40:19,623 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:19,815 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-11-29 01:40:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:40:19,816 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-29 01:40:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:19,817 INFO L225 Difference]: With dead ends: 85 [2023-11-29 01:40:19,817 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 01:40:19,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2023-11-29 01:40:19,819 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:19,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:40:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 01:40:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-11-29 01:40:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-11-29 01:40:19,828 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-11-29 01:40:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:19,829 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-11-29 01:40:19,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:40:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-11-29 01:40:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 01:40:19,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:19,831 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:19,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:40:20,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:40:20,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:40:20,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:20,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 3 times [2023-11-29 01:40:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:40:20,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760450842] [2023-11-29 01:40:20,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:40:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-29 01:40:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:40:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760450842] [2023-11-29 01:40:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760450842] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:40:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907530855] [2023-11-29 01:40:23,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:40:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:40:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:40:23,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:40:23,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:40:33,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-29 01:40:33,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:40:33,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-29 01:40:33,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:40:33,949 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 01:40:34,033 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:40:34,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 01:40:34,082 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 15 treesize of output 1 [2023-11-29 01:40:34,147 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 01:40:34,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2023-11-29 01:40:34,212 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:40:34,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-29 01:40:34,282 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:40:34,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2023-11-29 01:40:34,303 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 13 treesize of output 9 [2023-11-29 01:40:34,389 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 01:40:34,389 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 1 case distinctions, treesize of input 37 treesize of output 25 [2023-11-29 01:40:34,455 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:40:34,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-29 01:40:34,555 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 01:40:34,555 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 01:40:34,634 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:40:34,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-29 01:40:34,685 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 01:40:34,686 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 01:40:34,751 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:40:34,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-29 01:40:34,804 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 01:40:34,804 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 01:40:34,871 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:40:34,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-29 01:40:34,922 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 01:40:34,922 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 01:40:34,967 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:40:34,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-29 01:40:35,018 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 01:40:35,019 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 01:40:35,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:40:35,092 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:40:35,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-29 01:40:35,187 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 01:40:35,188 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 01:40:35,333 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-29 01:40:35,333 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 51 [2023-11-29 01:40:35,346 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-11-29 01:40:35,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:40:35,400 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 18 treesize of output 12 [2023-11-29 01:40:35,421 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 48 treesize of output 42 [2023-11-29 01:40:35,605 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 01:40:35,605 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 1 case distinctions, treesize of input 54 treesize of output 46 [2023-11-29 01:40:35,907 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 01:40:35,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 86 [2023-11-29 01:40:35,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 1 [2023-11-29 01:40:36,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:36,036 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 88 treesize of output 108 [2023-11-29 01:40:36,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:36,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 135 [2023-11-29 01:40:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 56 proven. 135 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 01:40:36,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:40:36,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:36,996 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 40 treesize of output 44 [2023-11-29 01:40:37,013 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 67 treesize of output 63 [2023-11-29 01:40:37,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:37,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-11-29 01:40:37,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:37,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 94 [2023-11-29 01:40:37,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:37,653 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 105 treesize of output 110 [2023-11-29 01:40:37,690 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 12 treesize of output 10 [2023-11-29 01:40:37,705 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 12 treesize of output 10 [2023-11-29 01:40:37,743 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_2 .cse3))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (= .cse0 0) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse1 v_arrayElimArr_1) .cse0 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse1 .cse0)))) (= .cse1 0)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse4 (select v_prenex_4 4)) (.cse5 (select v_arrayElimArr_2 .cse3))) (or (= .cse4 0) (= .cse5 .cse4) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse5 v_prenex_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse5 0))))))) is different from false [2023-11-29 01:40:37,880 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 .cse4))) (or (not (= 0 (select (select (store (store (store .cse0 v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse2 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= .cse1 .cse2) (= .cse2 0) (= .cse1 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_2 .cse4))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse5 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse5) (= .cse6 .cse5) (= .cse5 0) (not (= (select (select (store (store (store .cse0 v_subst_2 v_arrayElimArr_2) .cse6 v_arrayElimArr_1) .cse5 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0))))) (= .cse6 0)))))) is different from false [2023-11-29 01:40:37,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:37,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 106 [2023-11-29 01:40:38,014 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= (select v_arrayElimArr_3 .cse2) 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse0 0) (= .cse1 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 .cse2) 0) (forall ((v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse5 (select v_prenex_9 4)) (.cse4 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse4) (= .cse5 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse5 v_arrayElimArr_1) .cse4 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse4 0) (= .cse5 .cse4)))))))) is different from false [2023-11-29 01:40:38,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:38,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 122 [2023-11-29 01:40:40,707 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select v_prenex_9 4)) (.cse2 (select v_arrayElimArr_1 4))) (or (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse1 v_arrayElimArr_1) .cse2 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse2) (= .cse1 0) (= .cse2 0) (= .cse1 .cse2) (= (select v_arrayElimArr_3 4) 0)))))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_3 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse4 (select v_prenex_4 4)) (.cse5 (select v_arrayElimArr_2 4))) (or (= .cse4 .cse5) (= (select v_arrayElimArr_4 .cse0) 0) (= (select v_prenex_11 4) 0) (= .cse4 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse5 v_prenex_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-29 01:40:40,877 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select v_prenex_9 4)) (.cse0 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (= .cse1 0) (= .cse0 0) (= .cse1 .cse0) (not (= (select (select (store (store (store (store (store .cse2 v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse1 v_arrayElimArr_1) .cse0 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_4 .cse4) 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse5 (select v_prenex_4 4)) (.cse6 (select v_arrayElimArr_2 4))) (or (= .cse5 .cse6) (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store .cse2 v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse6 v_prenex_4) .cse5 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_4 .cse4) 0) (= .cse5 0) (= .cse6 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-29 01:40:40,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:40,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 138 [2023-11-29 01:40:41,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select v_prenex_9 4)) (.cse0 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (= .cse1 0) (= .cse0 0) (= .cse1 .cse0) (not (= (select (select (store (store (store (store (store (store .cse2 v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse1 v_arrayElimArr_1) .cse0 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_5 .cse4) 0))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_2 4)) (.cse5 (select v_prenex_4 4))) (or (= .cse5 .cse6) (= (select v_prenex_11 4) 0) (= (select v_prenex_13 4) 0) (= .cse5 0) (= (select v_arrayElimArr_5 .cse4) 0) (= .cse6 0) (not (= (select (select (store (store (store (store (store (store .cse2 v_subst_7 v_arrayElimArr_5) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse6 v_prenex_4) .cse5 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-29 01:40:41,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:41,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 154 [2023-11-29 01:40:46,091 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse2 (select v_prenex_9 4)) (.cse1 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse1) (= (select v_arrayElimArr_5 4) 0) (= .cse2 0) (not (= 0 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse2 v_arrayElimArr_1) .cse1 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= .cse1 0) (= .cse2 .cse1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse4 (select v_prenex_4 4)) (.cse5 (select v_arrayElimArr_2 4))) (or (= (select v_arrayElimArr_6 .cse0) 0) (= .cse4 .cse5) (= (select v_prenex_11 4) 0) (= (select v_prenex_13 4) 0) (= .cse4 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_7 v_prenex_15) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse5 v_prenex_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 0) (= (select v_prenex_15 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-29 01:40:46,359 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse0 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store (store (store .cse2 v_subst_9 v_arrayElimArr_6) v_subst_7 v_prenex_15) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_prenex_13 4) 0) (= .cse0 0) (= (select v_arrayElimArr_6 .cse4) 0) (= .cse1 0) (= (select v_prenex_15 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int)) (let ((.cse6 (select v_prenex_9 4)) (.cse5 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse5) (not (= (select (select (store (store (store (store (store (store (store .cse2 v_subst_10 v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse6 v_arrayElimArr_1) .cse5 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_5 4) 0) (= .cse6 0) (= .cse5 0) (= .cse6 .cse5) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_6 .cse4) 0))))) is different from false [2023-11-29 01:40:46,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:46,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 170 [2023-11-29 01:40:46,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse0 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_9 v_prenex_17) v_subst_7 v_prenex_15) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_prenex_13 4) 0) (= .cse0 0) (= 0 (select v_prenex_17 4)) (= .cse1 0) (= (select v_arrayElimArr_7 .cse3) 0) (= (select v_prenex_15 4) 0))))) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int)) (let ((.cse5 (select v_prenex_9 4)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select v_arrayElimArr_6 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse4) (= (select v_arrayElimArr_5 4) 0) (= .cse5 0) (= .cse4 0) (= .cse5 .cse4) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_10 v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse5 v_arrayElimArr_1) .cse4 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_7 .cse3) 0))))) is different from false [2023-11-29 01:40:46,972 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_12 Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse0 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= (select v_prenex_11 4) 0) (= (select v_arrayElimArr_7 .cse2) 0) (= (select v_prenex_13 4) 0) (= .cse0 0) (not (= (select (select (store (store (store (store (store (store (store (store .cse3 v_subst_12 v_arrayElimArr_7) v_subst_9 v_prenex_17) v_subst_7 v_prenex_15) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (= 0 (select v_prenex_17 4)) (= .cse1 0) (= (select v_prenex_15 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (= (select v_arrayElimArr_7 .cse2) 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int)) (let ((.cse6 (select v_prenex_9 4)) (.cse5 (select v_arrayElimArr_1 4))) (or (= (select v_arrayElimArr_6 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse5) (= (select v_arrayElimArr_5 4) 0) (= .cse6 0) (= .cse5 0) (not (= (select (select (store (store (store (store (store (store (store (store .cse3 v_subst_11 v_arrayElimArr_7) v_subst_10 v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse6 v_arrayElimArr_1) .cse5 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (= .cse6 .cse5) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))))))) is different from false [2023-11-29 01:40:47,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:40:47,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 186 [2023-11-29 01:40:47,313 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_subst_12 Int) (v_prenex_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse0 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) v_subst_12 v_prenex_19) v_subst_9 v_prenex_17) v_subst_7 v_prenex_15) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_prenex_13 4) 0) (= .cse0 0) (= (select v_arrayElimArr_8 .cse3) 0) (= 0 (select v_prenex_17 4)) (= .cse1 0) (= (select v_prenex_19 4) 0) (= (select v_prenex_15 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int)) (let ((.cse5 (select v_prenex_9 4)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select v_arrayElimArr_6 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse4) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) v_subst_11 v_arrayElimArr_7) v_subst_10 v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse5 v_arrayElimArr_1) .cse4 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse5 0) (= 0 (select v_arrayElimArr_7 4)) (= .cse4 0) (= .cse5 .cse4) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_8 .cse3) 0))))) is different from false [2023-11-29 01:41:00,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:41:00,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2023-11-29 01:41:00,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:42:16,569 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 01:42:16,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:42:16,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:42:16,770 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 103825 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) 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: line 103825 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) 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) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 55 more [2023-11-29 01:42:16,773 INFO L158 Benchmark]: Toolchain (without parser) took 119950.66ms. Allocated memory was 153.1MB in the beginning and 14.8GB in the end (delta: 14.6GB). Free memory was 116.7MB in the beginning and 10.2GB in the end (delta: -10.0GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2023-11-29 01:42:16,773 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:42:16,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.49ms. Allocated memory is still 153.1MB. Free memory was 116.7MB in the beginning and 99.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:42:16,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.93ms. Allocated memory is still 153.1MB. Free memory was 99.7MB in the beginning and 98.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:42:16,774 INFO L158 Benchmark]: Boogie Preprocessor took 43.91ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 95.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:42:16,774 INFO L158 Benchmark]: RCFGBuilder took 350.04ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 81.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:42:16,774 INFO L158 Benchmark]: TraceAbstraction took 119107.41ms. Allocated memory was 153.1MB in the beginning and 14.8GB in the end (delta: 14.6GB). Free memory was 81.2MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2023-11-29 01:42:16,776 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 153.1MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.49ms. Allocated memory is still 153.1MB. Free memory was 116.7MB in the beginning and 99.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.93ms. Allocated memory is still 153.1MB. Free memory was 99.7MB in the beginning and 98.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.91ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 95.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.04ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 81.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 119107.41ms. Allocated memory was 153.1MB in the beginning and 14.8GB in the end (delta: 14.6GB). Free memory was 81.2MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 103825 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 103825 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 01:42:16,984 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 01:42:17,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:42:19,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:42:19,278 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:42:19,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:42:19,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:42:19,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:42:19,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:42:19,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:42:19,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:42:19,313 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:42:19,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:42:19,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:42:19,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:42:19,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:42:19,316 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:42:19,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:42:19,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:42:19,318 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:42:19,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:42:19,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:42:19,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:42:19,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:42:19,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:42:19,321 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:42:19,322 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:42:19,322 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:42:19,322 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:42:19,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:42:19,323 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:42:19,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:42:19,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:42:19,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:42:19,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:42:19,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:42:19,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:42:19,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:42:19,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:42:19,326 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:42:19,326 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:42:19,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:42:19,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:42:19,327 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:42:19,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:42:19,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:42:19,327 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:42:19,328 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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 -> 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 [2023-11-29 01:42:19,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:42:19,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:42:19,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:42:19,649 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:42:19,650 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:42:19,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2023-11-29 01:42:22,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:42:22,735 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:42:22,736 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2023-11-29 01:42:22,751 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/data/c9468f766/1da3ae6f97a54c4bb627a9d54746cc1d/FLAG8d1ac9d19 [2023-11-29 01:42:22,763 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/data/c9468f766/1da3ae6f97a54c4bb627a9d54746cc1d [2023-11-29 01:42:22,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:42:22,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:42:22,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:42:22,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:42:22,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:42:22,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:42:22" (1/1) ... [2023-11-29 01:42:22,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314f9e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:22, skipping insertion in model container [2023-11-29 01:42:22,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:42:22" (1/1) ... [2023-11-29 01:42:22,814 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:42:23,064 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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-29 01:42:23,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:42:23,083 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:42:23,131 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_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-29 01:42:23,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:42:23,167 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:42:23,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23 WrapperNode [2023-11-29 01:42:23,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:42:23,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:42:23,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:42:23,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:42:23,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,215 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-11-29 01:42:23,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:42:23,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:42:23,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:42:23,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:42:23,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,246 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-11-29 01:42:23,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:42:23,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:42:23,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:42:23,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:42:23,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (1/1) ... [2023-11-29 01:42:23,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:42:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:42:23,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:42:23,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:42:23,343 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 01:42:23,343 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 01:42:23,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 01:42:23,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 01:42:23,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:42:23,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:42:23,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:42:23,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:42:23,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:42:23,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:42:23,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:42:23,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:42:23,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:42:23,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:42:23,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:42:23,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:42:23,448 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:42:23,451 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:42:23,504 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 01:42:23,665 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:42:23,687 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:42:23,688 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 01:42:23,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:42:23 BoogieIcfgContainer [2023-11-29 01:42:23,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:42:23,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:42:23,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:42:23,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:42:23,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:42:22" (1/3) ... [2023-11-29 01:42:23,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d593b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:42:23, skipping insertion in model container [2023-11-29 01:42:23,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:23" (2/3) ... [2023-11-29 01:42:23,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d593b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:42:23, skipping insertion in model container [2023-11-29 01:42:23,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:42:23" (3/3) ... [2023-11-29 01:42:23,697 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2023-11-29 01:42:23,730 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:42:23,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:42:23,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:42:23,785 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;@79099b3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:42:23,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:42:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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 01:42:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 01:42:23,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:42:23,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:42:23,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:42:23,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-11-29 01:42:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:42:23,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343508454] [2023-11-29 01:42:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:23,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 01:42:23,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:42:23,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:23,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:23,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:42:23,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:42:23,937 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 01:42:23,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:42:23,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:42:23,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343508454] [2023-11-29 01:42:23,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343508454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:23,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:23,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:42:23,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556832559] [2023-11-29 01:42:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:23,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:42:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:42:23,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:42:23,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:42:23,977 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:42:24,001 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-29 01:42:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:42:24,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 01:42:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:42:24,009 INFO L225 Difference]: With dead ends: 34 [2023-11-29 01:42:24,010 INFO L226 Difference]: Without dead ends: 17 [2023-11-29 01:42:24,012 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 01:42:24,016 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:42:24,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:42:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-29 01:42:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-29 01:42:24,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-29 01:42:24,048 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-11-29 01:42:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:42:24,048 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-29 01:42:24,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-29 01:42:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:42:24,049 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:42:24,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:42:24,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:24,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:24,251 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:42:24,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-11-29 01:42:24,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:42:24,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765085582] [2023-11-29 01:42:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:24,252 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 01:42:24,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:42:24,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:24,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:42:24,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:42:24,367 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 01:42:24,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:42:24,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:42:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765085582] [2023-11-29 01:42:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765085582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:42:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477742230] [2023-11-29 01:42:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:24,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:42:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:42:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:42:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:42:24,372 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:42:24,464 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2023-11-29 01:42:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:42:24,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 01:42:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:42:24,467 INFO L225 Difference]: With dead ends: 37 [2023-11-29 01:42:24,467 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 01:42:24,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:42:24,469 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:42:24,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:42:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 01:42:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-29 01:42:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-29 01:42:24,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-11-29 01:42:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:42:24,476 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-29 01:42:24,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-29 01:42:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 01:42:24,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:42:24,477 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:42:24,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:24,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:24,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:42:24,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-11-29 01:42:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:42:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458224469] [2023-11-29 01:42:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:24,683 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 01:42:24,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:42:24,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:24,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:42:24,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:42:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:42:24,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:42:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:42:24,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:42:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458224469] [2023-11-29 01:42:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458224469] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:42:24,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:42:24,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-11-29 01:42:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66286934] [2023-11-29 01:42:24,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:42:24,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:42:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:42:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:42:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:42:24,882 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:42:25,121 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-11-29 01:42:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:42:25,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 01:42:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:42:25,125 INFO L225 Difference]: With dead ends: 53 [2023-11-29 01:42:25,125 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 01:42:25,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:42:25,126 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:42:25,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:42:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 01:42:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-11-29 01:42:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-29 01:42:25,133 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 15 [2023-11-29 01:42:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:42:25,134 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-29 01:42:25,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-29 01:42:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:42:25,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:42:25,135 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:42:25,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:25,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:25,336 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:42:25,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash -813781656, now seen corresponding path program 2 times [2023-11-29 01:42:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:42:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13902646] [2023-11-29 01:42:25,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:42:25,337 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 01:42:25,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:42:25,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:25,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:25,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 01:42:25,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:42:25,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:42:25,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:42:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-29 01:42:25,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:42:25,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:42:25,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13902646] [2023-11-29 01:42:25,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13902646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:25,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:25,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:42:25,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61406198] [2023-11-29 01:42:25,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:25,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:42:25,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:42:25,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:42:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:42:25,510 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:42:25,605 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-11-29 01:42:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:42:25,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 01:42:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:42:25,607 INFO L225 Difference]: With dead ends: 43 [2023-11-29 01:42:25,607 INFO L226 Difference]: Without dead ends: 40 [2023-11-29 01:42:25,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:42:25,608 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:42:25,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:42:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-29 01:42:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-11-29 01:42:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-29 01:42:25,616 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 30 [2023-11-29 01:42:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:42:25,616 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-29 01:42:25,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-29 01:42:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 01:42:25,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:42:25,618 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:42:25,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:25,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:25,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:42:25,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 1 times [2023-11-29 01:42:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:42:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181301931] [2023-11-29 01:42:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:25,820 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 01:42:25,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:42:25,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:25,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:42:25,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:42:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:42:26,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:42:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:42:26,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:42:26,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181301931] [2023-11-29 01:42:26,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181301931] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:42:26,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:42:26,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-11-29 01:42:26,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15751181] [2023-11-29 01:42:26,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:42:26,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:42:26,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:42:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:42:26,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:42:26,269 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:42:27,145 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-11-29 01:42:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:42:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-29 01:42:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:42:27,149 INFO L225 Difference]: With dead ends: 85 [2023-11-29 01:42:27,149 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 01:42:27,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=466, Unknown=0, NotChecked=0, Total=702 [2023-11-29 01:42:27,151 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:42:27,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 155 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:42:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 01:42:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-11-29 01:42:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-11-29 01:42:27,158 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-11-29 01:42:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:42:27,158 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-11-29 01:42:27,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-11-29 01:42:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 01:42:27,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:42:27,160 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:42:27,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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)] Ended with exit code 0 [2023-11-29 01:42:27,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:27,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:42:27,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 2 times [2023-11-29 01:42:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:42:27,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557679470] [2023-11-29 01:42:27,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:42:27,362 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 01:42:27,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:42:27,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:42:27,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 01:42:28,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:42:28,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:42:28,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-29 01:42:28,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:42:28,295 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 01:42:28,438 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:42:28,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:42:28,458 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 01:42:28,564 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 27 treesize of output 11 [2023-11-29 01:42:28,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:28,712 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:42:28,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:42:28,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:29,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:29,101 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:42:29,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:42:29,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:29,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:29,492 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:42:29,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:42:29,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:29,767 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:42:29,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:42:29,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:29,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:29,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:30,051 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:42:30,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:42:30,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:30,306 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:42:30,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:42:30,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:30,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:30,585 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:42:30,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:42:30,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:30,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:30,882 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:42:30,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 01:42:30,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:30,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:31,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:31,137 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 01:42:31,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 01:42:31,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:31,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:42:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-29 01:42:31,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:42:31,321 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-11-29 01:42:31,424 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_21|))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2023-11-29 01:42:31,469 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_390) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_21|))))) is different from false [2023-11-29 01:42:54,444 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_25|) (_ bv0 1))) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (_ bv2 32) (select (select (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_23|) (_ bv0 1)))))))) is different from false [2023-11-29 01:43:03,498 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_367 (_ BitVec 1)) (v_ArrVal_362 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32)) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_362))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_367))) (let ((.cse4 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (select (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|) (_ bv0 1))) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_25|) (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_27|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_26|))) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_366) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_369) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22|))) (not (= (_ bv0 1) (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_23|))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_24|)))))))))) is different from false [2023-11-29 01:43:18,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_357 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (|v_ULTIMATE.start_main_~t~0#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_367 (_ BitVec 1)) (v_ArrVal_362 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_357))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_362))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_367))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse5 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse1 (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24|))) (not (= (_ bv2 32) (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_360) |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_366) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_369) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22|))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_25|))) (not (= (select (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|) (_ bv0 1))) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_27|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_26|))) (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_23|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_28|))))))))))) is different from false [2023-11-29 01:43:19,206 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_357 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (v_ArrVal_353 (_ BitVec 1)) (|v_ULTIMATE.start_main_~t~0#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_29| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_367 (_ BitVec 1)) (v_ArrVal_362 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_353))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_357))) (let ((.cse5 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_362))) (let ((.cse3 (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_367))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse6 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse1 (store .cse6 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (_ bv0 1) (select (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|))) (not (= (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_355) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_360) |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_366) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_369) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_22|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_27|))) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_25|) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|))) (not (= (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_28|) (_ bv0 1))) (not (= (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_26|) (_ bv0 1))) (not (= (select .cse6 |v_ULTIMATE.start_main_~t~0#1.base_23|) (_ bv0 1)))))))))))) is different from false [2023-11-29 01:43:26,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:43:26,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2023-11-29 01:44:58,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:44:58,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557679470] [2023-11-29 01:44:58,904 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 01:44:58,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 01:44:59,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/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 01:44:59,105 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 59005 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java: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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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: line 59005 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) 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) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 53 more [2023-11-29 01:44:59,109 INFO L158 Benchmark]: Toolchain (without parser) took 156340.79ms. Allocated memory was 69.2MB in the beginning and 15.4GB in the end (delta: 15.3GB). Free memory was 44.6MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 6.1GB. Max. memory is 16.1GB. [2023-11-29 01:44:59,109 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 69.2MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:44:59,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.35ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 44.3MB in the beginning and 65.0MB in the end (delta: -20.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2023-11-29 01:44:59,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.64ms. Allocated memory is still 92.3MB. Free memory was 65.0MB in the beginning and 62.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:44:59,110 INFO L158 Benchmark]: Boogie Preprocessor took 54.24ms. Allocated memory is still 92.3MB. Free memory was 62.8MB in the beginning and 60.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:44:59,110 INFO L158 Benchmark]: RCFGBuilder took 417.20ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 44.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:44:59,111 INFO L158 Benchmark]: TraceAbstraction took 155417.25ms. Allocated memory was 92.3MB in the beginning and 15.4GB in the end (delta: 15.3GB). Free memory was 44.4MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 6.1GB. Max. memory is 16.1GB. [2023-11-29 01:44:59,113 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.23ms. Allocated memory is still 69.2MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.35ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 44.3MB in the beginning and 65.0MB in the end (delta: -20.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.64ms. Allocated memory is still 92.3MB. Free memory was 65.0MB in the beginning and 62.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.24ms. Allocated memory is still 92.3MB. Free memory was 62.8MB in the beginning and 60.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 417.20ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 44.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 155417.25ms. Allocated memory was 92.3MB in the beginning and 15.4GB in the end (delta: 15.3GB). Free memory was 44.4MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 6.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 59005 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 59005 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 01:44:59,321 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 01:44:59,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1303608a-5e7c-403d-8ae4-b8cc3ddb3055/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 59005 column 7: canceled