./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.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_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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_252a4252-cff4-4e0a-933a-ed733195dd1b/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 aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:44:16,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:44:16,709 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:44:16,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:44:16,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:44:16,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:44:16,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:44:16,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:44:16,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:44:16,738 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:44:16,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:44:16,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:44:16,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:44:16,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:44:16,740 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:44:16,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:44:16,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:44:16,742 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:44:16,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:44:16,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:44:16,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:44:16,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:44:16,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:44:16,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:44:16,745 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:44:16,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:44:16,746 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:44:16,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:44:16,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:44:16,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:44:16,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:44:16,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:44:16,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:44:16,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:44:16,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:44:16,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:44:16,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:44:16,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:44:16,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:44:16,750 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:44:16,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:44:16,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:44:16,750 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_252a4252-cff4-4e0a-933a-ed733195dd1b/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_252a4252-cff4-4e0a-933a-ed733195dd1b/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 -> aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 [2023-11-29 02:44:16,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:44:17,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:44:17,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:44:17,007 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:44:17,008 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:44:17,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2023-11-29 02:44:19,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:44:19,922 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:44:19,923 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2023-11-29 02:44:19,932 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/data/2141ca029/debd36a7c1754b9eab441760bb6416f8/FLAG39d848a62 [2023-11-29 02:44:19,951 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/data/2141ca029/debd36a7c1754b9eab441760bb6416f8 [2023-11-29 02:44:19,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:44:19,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:44:19,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:44:19,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:44:19,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:44:19,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:44:19" (1/1) ... [2023-11-29 02:44:19,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537c199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:19, skipping insertion in model container [2023-11-29 02:44:19,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:44:19" (1/1) ... [2023-11-29 02:44:19,989 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:44:20,129 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_252a4252-cff4-4e0a-933a-ed733195dd1b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2023-11-29 02:44:20,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:44:20,182 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:44:20,195 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_252a4252-cff4-4e0a-933a-ed733195dd1b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2023-11-29 02:44:20,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:44:20,229 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:44:20,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20 WrapperNode [2023-11-29 02:44:20,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:44:20,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:44:20,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:44:20,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:44:20,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,272 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2023-11-29 02:44:20,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:44:20,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:44:20,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:44:20,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:44:20,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,300 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 02:44:20,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:44:20,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:44:20,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:44:20,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:44:20,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (1/1) ... [2023-11-29 02:44:20,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:44:20,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:44:20,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:44:20,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:44:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:44:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:44:20,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:44:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:44:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:44:20,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:44:20,446 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:44:20,448 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:44:20,600 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:44:20,634 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:44:20,634 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:44:20,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:44:20 BoogieIcfgContainer [2023-11-29 02:44:20,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:44:20,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:44:20,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:44:20,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:44:20,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:44:19" (1/3) ... [2023-11-29 02:44:20,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee5535f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:44:20, skipping insertion in model container [2023-11-29 02:44:20,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:20" (2/3) ... [2023-11-29 02:44:20,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee5535f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:44:20, skipping insertion in model container [2023-11-29 02:44:20,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:44:20" (3/3) ... [2023-11-29 02:44:20,644 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-60.i [2023-11-29 02:44:20,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:44:20,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:44:20,712 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:44:20,719 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;@69d6b3ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:44:20,719 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:44:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:44:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 02:44:20,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:20,731 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:20,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:44:20,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1346839555, now seen corresponding path program 1 times [2023-11-29 02:44:20,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:44:20,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185619387] [2023-11-29 02:44:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:20,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:44:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:44:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:20,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:44:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:44:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:20,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:44:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:44:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:44:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 02:44:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:44:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185619387] [2023-11-29 02:44:20,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185619387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:44:20,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:44:20,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:44:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076812640] [2023-11-29 02:44:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:44:20,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:44:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:44:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:44:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:44:21,013 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 02:44:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:21,048 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2023-11-29 02:44:21,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:44:21,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-29 02:44:21,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:21,059 INFO L225 Difference]: With dead ends: 62 [2023-11-29 02:44:21,060 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 02:44:21,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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 02:44:21,098 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:21,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:44:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 02:44:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 02:44:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:44:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-11-29 02:44:21,157 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 45 [2023-11-29 02:44:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:21,157 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-11-29 02:44:21,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 02:44:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-11-29 02:44:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 02:44:21,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:21,160 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:21,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:44:21,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:44:21,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash -380037489, now seen corresponding path program 1 times [2023-11-29 02:44:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:44:21,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40718577] [2023-11-29 02:44:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:44:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:44:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:44:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:44:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:44:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:44:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:44:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 02:44:21,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:44:21,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40718577] [2023-11-29 02:44:21,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40718577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:44:21,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:44:21,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:44:21,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499464167] [2023-11-29 02:44:21,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:44:21,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:44:21,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:44:21,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:44:21,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:44:21,387 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:44:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:21,414 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2023-11-29 02:44:21,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:44:21,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2023-11-29 02:44:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:21,416 INFO L225 Difference]: With dead ends: 57 [2023-11-29 02:44:21,416 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 02:44:21,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 02:44:21,419 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:21,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:44:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 02:44:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 02:44:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:44:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-11-29 02:44:21,428 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 45 [2023-11-29 02:44:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:21,430 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-29 02:44:21,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:44:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2023-11-29 02:44:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 02:44:21,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:21,432 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:21,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:44:21,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:44:21,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1906004842, now seen corresponding path program 1 times [2023-11-29 02:44:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:44:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786398968] [2023-11-29 02:44:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:44:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:44:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:44:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:44:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:44:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:44:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:44:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 02:44:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:44:21,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786398968] [2023-11-29 02:44:21,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786398968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:44:21,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:44:21,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:44:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121660348] [2023-11-29 02:44:21,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:44:21,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:44:21,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:44:21,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:44:21,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:44:21,559 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:44:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:21,584 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2023-11-29 02:44:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:44:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-11-29 02:44:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:21,587 INFO L225 Difference]: With dead ends: 57 [2023-11-29 02:44:21,587 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 02:44:21,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 02:44:21,589 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:21,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:44:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 02:44:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 02:44:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:44:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-29 02:44:21,598 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 46 [2023-11-29 02:44:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:21,599 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-29 02:44:21,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:44:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-11-29 02:44:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 02:44:21,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:21,601 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:21,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:44:21,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:44:21,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1905945260, now seen corresponding path program 1 times [2023-11-29 02:44:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:44:21,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121096039] [2023-11-29 02:44:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:44:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:44:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:44:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:44:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:44:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:44:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:44:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 02:44:21,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:44:21,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121096039] [2023-11-29 02:44:21,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121096039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:44:21,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:44:21,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:44:21,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20675327] [2023-11-29 02:44:21,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:44:21,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:44:21,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:44:21,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:44:21,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:44:21,781 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:44:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:21,855 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2023-11-29 02:44:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:44:21,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-11-29 02:44:21,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:21,857 INFO L225 Difference]: With dead ends: 93 [2023-11-29 02:44:21,857 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 02:44:21,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 02:44:21,859 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:21,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 95 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:44:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 02:44:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2023-11-29 02:44:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:44:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2023-11-29 02:44:21,873 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 46 [2023-11-29 02:44:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:21,874 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2023-11-29 02:44:21,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:44:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2023-11-29 02:44:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 02:44:21,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:21,875 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:21,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:44:21,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:44:21,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:21,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1603953589, now seen corresponding path program 1 times [2023-11-29 02:44:21,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:44:21,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576169172] [2023-11-29 02:44:21,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:21,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:44:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:44:21,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:44:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:44:21,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:44:21,956 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:44:21,957 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:44:21,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:44:21,962 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 02:44:21,965 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:44:22,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:44:22 BoogieIcfgContainer [2023-11-29 02:44:22,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:44:22,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:44:22,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:44:22,005 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:44:22,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:44:20" (3/4) ... [2023-11-29 02:44:22,007 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:44:22,009 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:44:22,009 INFO L158 Benchmark]: Toolchain (without parser) took 2054.28ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 112.8MB in the beginning and 83.8MB in the end (delta: 29.0MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2023-11-29 02:44:22,010 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:44:22,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.40ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 100.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 02:44:22,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.84ms. Allocated memory is still 151.0MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:44:22,011 INFO L158 Benchmark]: Boogie Preprocessor took 41.19ms. Allocated memory is still 151.0MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:44:22,012 INFO L158 Benchmark]: RCFGBuilder took 320.24ms. Allocated memory is still 151.0MB. Free memory was 96.5MB in the beginning and 81.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 02:44:22,012 INFO L158 Benchmark]: TraceAbstraction took 1366.17ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 80.8MB in the beginning and 83.8MB in the end (delta: -3.0MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2023-11-29 02:44:22,012 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 188.7MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:44:22,014 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.18ms. Allocated memory is still 151.0MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.40ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 100.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.84ms. Allocated memory is still 151.0MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.19ms. Allocated memory is still 151.0MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.24ms. Allocated memory is still 151.0MB. Free memory was 96.5MB in the beginning and 81.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1366.17ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 80.8MB in the beginning and 83.8MB in the end (delta: -3.0MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 188.7MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.6; [L23] double var_1_2 = 64.25; [L24] double var_1_3 = 31.2; [L25] signed long int var_1_4 = 1; [L26] float var_1_7 = 100.5; [L27] float var_1_9 = 50.2; [L28] float var_1_10 = 0.125; [L29] float var_1_11 = 9999999999999.8; [L30] float var_1_12 = 3.5; [L31] unsigned short int var_1_13 = 0; [L32] double last_1_var_1_1 = 9999.6; [L33] unsigned short int last_1_var_1_13 = 0; [L82] isInitial = 1 [L83] FCALL initially() [L84] int k_loop; [L85] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L85] COND TRUE k_loop < 1 [L86] CALL updateLastVariables() [L74] last_1_var_1_1 = var_1_1 [L75] last_1_var_1_13 = var_1_13 [L86] RET updateLastVariables() [L87] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L61] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L64] var_1_9 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L65] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L66] var_1_10 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L67] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L68] var_1_11 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L69] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L70] var_1_12 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L71] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L87] RET updateVariables() [L88] CALL step() [L37] COND TRUE (- last_1_var_1_13) >= last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L38] COND FALSE !(last_1_var_1_13 > last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L46] COND TRUE -4 < var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L47] COND TRUE var_1_11 <= (24.6f * var_1_9) [L48] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=1, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L51] var_1_1 = (var_1_2 - var_1_3) [L52] signed long int stepLocal_0 = var_1_13 + var_1_4; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, stepLocal_0=2, var_1_13=1, var_1_4=1, var_1_7=201/2] [L53] COND FALSE !(stepLocal_0 < var_1_4) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, stepLocal_0=2, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L88] RET step() [L89] CALL, EXPR property() [L78-L79] return (((var_1_1 == ((double) (var_1_2 - var_1_3))) && (((- last_1_var_1_13) >= last_1_var_1_13) ? ((last_1_var_1_13 > last_1_var_1_13) ? ((var_1_3 == last_1_var_1_1) ? (var_1_4 == ((signed long int) last_1_var_1_13)) : (var_1_4 == ((signed long int) last_1_var_1_13))) : 1) : 1)) && (((var_1_13 + var_1_4) < var_1_4) ? (var_1_7 == ((float) (((((var_1_3 - (var_1_9 + var_1_10))) < ((var_1_11 + var_1_12))) ? ((var_1_3 - (var_1_9 + var_1_10))) : ((var_1_11 + var_1_12)))))) : (var_1_7 == ((float) var_1_11)))) && ((-4 < var_1_4) ? ((var_1_11 <= (24.6f * var_1_9)) ? (var_1_13 == ((unsigned short int) var_1_4)) : 1) : 1) ; [L89] RET, EXPR property() [L89] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 129 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 02:44:22,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 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_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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_252a4252-cff4-4e0a-933a-ed733195dd1b/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 aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:44:23,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:44:24,048 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 02:44:24,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:44:24,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:44:24,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:44:24,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:44:24,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:44:24,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:44:24,092 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:44:24,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:44:24,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:44:24,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:44:24,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:44:24,095 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:44:24,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:44:24,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:44:24,097 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:44:24,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:44:24,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:44:24,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:44:24,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:44:24,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:44:24,100 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:44:24,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:44:24,101 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:44:24,102 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:44:24,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:44:24,102 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:44:24,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:44:24,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:44:24,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:44:24,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:44:24,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:44:24,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:44:24,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:44:24,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:44:24,105 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:44:24,106 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:44:24,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:44:24,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:44:24,107 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:44:24,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:44:24,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:44:24,107 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:44:24,107 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_252a4252-cff4-4e0a-933a-ed733195dd1b/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_252a4252-cff4-4e0a-933a-ed733195dd1b/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 -> aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 [2023-11-29 02:44:24,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:44:24,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:44:24,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:44:24,433 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:44:24,433 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:44:24,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2023-11-29 02:44:27,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:44:27,330 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:44:27,331 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2023-11-29 02:44:27,339 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/data/5b670afa7/3c9ad087da3a4e9c8f9ae7d81e4c7570/FLAG8c156c853 [2023-11-29 02:44:27,352 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/data/5b670afa7/3c9ad087da3a4e9c8f9ae7d81e4c7570 [2023-11-29 02:44:27,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:44:27,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:44:27,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:44:27,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:44:27,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:44:27,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35697c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27, skipping insertion in model container [2023-11-29 02:44:27,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,388 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:44:27,516 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_252a4252-cff4-4e0a-933a-ed733195dd1b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2023-11-29 02:44:27,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:44:27,572 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:44:27,583 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_252a4252-cff4-4e0a-933a-ed733195dd1b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2023-11-29 02:44:27,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:44:27,619 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:44:27,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27 WrapperNode [2023-11-29 02:44:27,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:44:27,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:44:27,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:44:27,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:44:27,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,664 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2023-11-29 02:44:27,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:44:27,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:44:27,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:44:27,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:44:27,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,694 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 02:44:27,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:44:27,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:44:27,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:44:27,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:44:27,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (1/1) ... [2023-11-29 02:44:27,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:44:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:44:27,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:44:27,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:44:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:44:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:44:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:44:27,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:44:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:44:27,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:44:27,923 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:44:27,926 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:44:36,391 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:44:36,439 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:44:36,439 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:44:36,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:44:36 BoogieIcfgContainer [2023-11-29 02:44:36,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:44:36,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:44:36,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:44:36,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:44:36,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:44:27" (1/3) ... [2023-11-29 02:44:36,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cca03c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:44:36, skipping insertion in model container [2023-11-29 02:44:36,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:44:27" (2/3) ... [2023-11-29 02:44:36,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cca03c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:44:36, skipping insertion in model container [2023-11-29 02:44:36,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:44:36" (3/3) ... [2023-11-29 02:44:36,448 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-60.i [2023-11-29 02:44:36,463 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:44:36,463 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:44:36,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:44:36,507 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;@586103a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:44:36,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:44:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:44:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 02:44:36,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:36,518 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:36,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:44:36,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1346839555, now seen corresponding path program 1 times [2023-11-29 02:44:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:44:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108098725] [2023-11-29 02:44:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:36,534 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 02:44:36,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:44:36,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:44:36,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:44:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:36,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 02:44:36,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 02:44:37,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:44:37,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:44:37,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108098725] [2023-11-29 02:44:37,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108098725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:44:37,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:44:37,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:44:37,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826924011] [2023-11-29 02:44:37,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:44:37,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:44:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:44:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:44:37,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:44:37,043 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 02:44:41,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:44:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:41,343 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2023-11-29 02:44:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:44:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-29 02:44:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:41,350 INFO L225 Difference]: With dead ends: 62 [2023-11-29 02:44:41,350 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 02:44:41,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 02:44:41,354 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:41,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 02:44:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 02:44:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 02:44:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:44:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-11-29 02:44:41,382 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 45 [2023-11-29 02:44:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:41,383 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-11-29 02:44:41,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 02:44:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-11-29 02:44:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 02:44:41,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:41,385 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:41,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:44:41,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:44:41,586 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:44:41,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash -380037489, now seen corresponding path program 1 times [2023-11-29 02:44:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:44:41,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553015405] [2023-11-29 02:44:41,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:41,588 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 02:44:41,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:44:41,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:44:41,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:44:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:42,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:44:42,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 02:44:42,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:44:42,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:44:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553015405] [2023-11-29 02:44:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553015405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:44:42,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:44:42,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:44:42,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533625804] [2023-11-29 02:44:42,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:44:42,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:44:42,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:44:42,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:44:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:44:42,308 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:44:46,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:44:50,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:44:54,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:44:59,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:03,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:07,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:45:07,232 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2023-11-29 02:45:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:45:07,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2023-11-29 02:45:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:45:07,235 INFO L225 Difference]: With dead ends: 95 [2023-11-29 02:45:07,235 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 02:45:07,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 02:45:07,237 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 14 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:45:07,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 96 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 24.9s Time] [2023-11-29 02:45:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 02:45:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-11-29 02:45:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:45:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2023-11-29 02:45:07,256 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 45 [2023-11-29 02:45:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:45:07,257 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2023-11-29 02:45:07,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:45:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2023-11-29 02:45:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 02:45:07,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:45:07,260 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:45:07,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:07,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:07,461 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:45:07,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:45:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1985008824, now seen corresponding path program 1 times [2023-11-29 02:45:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:45:07,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139610556] [2023-11-29 02:45:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:45:07,462 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 02:45:07,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:45:07,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:07,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:07,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:45:07,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:45:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 02:45:08,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:45:08,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:45:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139610556] [2023-11-29 02:45:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139610556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:45:08,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:45:08,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:45:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975920000] [2023-11-29 02:45:08,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:45:08,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:45:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:45:08,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:45:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:45:08,076 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:45:12,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:16,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:45:16,719 INFO L93 Difference]: Finished difference Result 109 states and 145 transitions. [2023-11-29 02:45:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:45:16,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-11-29 02:45:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:45:16,721 INFO L225 Difference]: With dead ends: 109 [2023-11-29 02:45:16,722 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 02:45:16,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 02:45:16,724 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:45:16,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2023-11-29 02:45:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 02:45:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-29 02:45:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:45:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2023-11-29 02:45:16,740 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 46 [2023-11-29 02:45:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:45:16,741 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2023-11-29 02:45:16,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:45:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2023-11-29 02:45:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 02:45:16,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:45:16,743 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:45:16,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:45:16,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:16,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:45:16,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:45:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1604013171, now seen corresponding path program 1 times [2023-11-29 02:45:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:45:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724455929] [2023-11-29 02:45:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:45:16,945 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 02:45:16,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:45:16,946 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:16,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:17,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:45:17,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:45:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 02:45:17,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:45:17,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:45:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724455929] [2023-11-29 02:45:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724455929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:45:17,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:45:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:45:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755320441] [2023-11-29 02:45:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:45:17,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:45:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:45:17,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:45:17,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:45:17,635 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:45:22,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:24,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:29,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:33,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:37,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:39,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:45:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:45:39,795 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2023-11-29 02:45:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:45:39,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 47 [2023-11-29 02:45:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:45:39,804 INFO L225 Difference]: With dead ends: 85 [2023-11-29 02:45:39,804 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 02:45:39,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:45:39,806 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 51 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:45:39,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 93 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 22.1s Time] [2023-11-29 02:45:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 02:45:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-11-29 02:45:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:45:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2023-11-29 02:45:39,821 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 47 [2023-11-29 02:45:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:45:39,821 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2023-11-29 02:45:39,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:45:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2023-11-29 02:45:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 02:45:39,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:45:39,823 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:45:39,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:40,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:40,024 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:45:40,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:45:40,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1603953589, now seen corresponding path program 1 times [2023-11-29 02:45:40,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:45:40,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935672514] [2023-11-29 02:45:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:45:40,025 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 02:45:40,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:45:40,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:40,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_252a4252-cff4-4e0a-933a-ed733195dd1b/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 02:45:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:45:40,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 02:45:40,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:08,487 WARN L293 SmtUtils]: Spent 7.36s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:46:30,113 WARN L293 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:46:41,933 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:46:50,156 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:46:58,487 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:47:08,205 WARN L293 SmtUtils]: Spent 7.95s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:47:16,438 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:47:24,646 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:47:37,789 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:47:46,021 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:47:57,155 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:48:05,356 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:48:20,814 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:48:32,888 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:48:41,114 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:48:49,215 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:49:00,713 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:49:07,454 WARN L293 SmtUtils]: Spent 6.74s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:49:15,736 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:49:23,961 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:49:34,048 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:49:41,641 WARN L293 SmtUtils]: Spent 7.59s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:49:54,266 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:50:02,588 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:50:10,831 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:50:19,085 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:50:30,332 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:50:38,571 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:50:54,534 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:51:02,759 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:51:11,022 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:51:19,263 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:51:27,413 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:51:37,930 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:51:46,196 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:51:54,435 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:52:02,673 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:52:13,010 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:52:21,217 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:52:29,420 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:52:37,450 WARN L293 SmtUtils]: Spent 7.97s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:52:48,453 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:52:54,157 WARN L293 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:53:04,766 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:53:12,975 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:53:21,179 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:53:29,447 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:53:37,720 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:53:45,989 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:53:56,736 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:54:05,051 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:54:17,860 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:54:26,132 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:54:34,395 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:54:42,668 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:54:50,926 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:55:04,451 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:55:12,700 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:55:26,917 WARN L293 SmtUtils]: Spent 7.49s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:55:38,788 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:55:53,367 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:56:00,242 WARN L293 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:56:08,496 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:56:16,788 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:56:25,068 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:56:35,575 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:56:43,822 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:56:52,092 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:57:04,930 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:57:13,198 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:57:24,621 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:57:32,855 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:57:49,414 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 13 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:58:01,486 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:58:08,348 WARN L293 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:58:19,144 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:58:27,519 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:58:41,972 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:58:50,314 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:58:58,517 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:59:06,656 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:59:18,789 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:59:27,028 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)