./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3047be65ea0fc5640e4cd865efbd9906b9eaeb4a8d01185b0a8bdb2377eb8eb2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:20:54,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:20:54,338 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:20:54,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:20:54,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:20:54,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:20:54,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:20:54,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:20:54,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:20:54,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:20:54,381 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:20:54,381 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:20:54,382 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:20:54,382 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:20:54,383 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:20:54,383 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:20:54,384 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:20:54,384 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:20:54,385 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:20:54,385 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:20:54,386 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:20:54,391 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:20:54,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:20:54,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:20:54,392 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:20:54,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:20:54,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:20:54,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:20:54,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:20:54,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:20:54,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:20:54,401 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:20:54,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:20:54,402 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:20:54,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:20:54,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:20:54,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:20:54,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:20:54,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:20:54,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:20:54,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:20:54,404 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:20:54,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:20:54,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:20:54,404 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:20:54,404 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:20:54,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:20:54,405 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 3047be65ea0fc5640e4cd865efbd9906b9eaeb4a8d01185b0a8bdb2377eb8eb2 [2023-12-02 15:20:54,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:20:54,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:20:54,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:20:54,636 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:20:54,636 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:20:54,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i [2023-12-02 15:20:57,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:20:57,609 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:20:57,612 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i [2023-12-02 15:20:57,620 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/data/2824f9c8e/58ddbef18cf84bda99152fbe729a0b87/FLAG8c049a71d [2023-12-02 15:20:57,633 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/data/2824f9c8e/58ddbef18cf84bda99152fbe729a0b87 [2023-12-02 15:20:57,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:20:57,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:20:57,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:20:57,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:20:57,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:20:57,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:57,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a7747c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57, skipping insertion in model container [2023-12-02 15:20:57,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:57,676 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:20:57,806 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_58418670-a75a-4f41-9830-be7222ef5b17/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i[915,928] [2023-12-02 15:20:57,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:20:57,864 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:20:57,874 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_58418670-a75a-4f41-9830-be7222ef5b17/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i[915,928] [2023-12-02 15:20:57,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:20:57,917 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:20:57,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57 WrapperNode [2023-12-02 15:20:57,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:20:57,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:20:57,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:20:57,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:20:57,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:57,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:57,974 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2023-12-02 15:20:57,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:20:57,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:20:57,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:20:57,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:20:57,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:57,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:57,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:57,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:58,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:58,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:58,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:58,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:58,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:20:58,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:20:58,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:20:58,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:20:58,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (1/1) ... [2023-12-02 15:20:58,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:20:58,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:58,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:20:58,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:20:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:20:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 15:20:58,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 15:20:58,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:20:58,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:20:58,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:20:58,173 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:20:58,175 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:20:58,422 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:20:58,516 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:20:58,517 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 15:20:58,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:58 BoogieIcfgContainer [2023-12-02 15:20:58,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:20:58,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:20:58,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:20:58,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:20:58,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:20:57" (1/3) ... [2023-12-02 15:20:58,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c56b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:20:58, skipping insertion in model container [2023-12-02 15:20:58,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:57" (2/3) ... [2023-12-02 15:20:58,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c56b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:20:58, skipping insertion in model container [2023-12-02 15:20:58,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:58" (3/3) ... [2023-12-02 15:20:58,529 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-89.i [2023-12-02 15:20:58,550 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:20:58,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:20:58,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:20:58,610 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=FINITE_AUTOMATA, 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;@81a6c9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:20:58,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:20:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 15:20:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-02 15:20:58,623 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:58,624 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:58,624 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:20:58,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 58858556, now seen corresponding path program 1 times [2023-12-02 15:20:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794878740] [2023-12-02 15:20:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:58,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:58,768 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 15:20:58,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832535739] [2023-12-02 15:20:58,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:58,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:20:58,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:58,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:20:58,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:20:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:20:58,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:20:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:20:59,051 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:20:59,054 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:20:59,055 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 15:20:59,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:20:59,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-02 15:20:59,262 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 15:20:59,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:20:59,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:20:59 BoogieIcfgContainer [2023-12-02 15:20:59,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:20:59,329 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:20:59,329 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:20:59,329 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:20:59,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:58" (3/4) ... [2023-12-02 15:20:59,332 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 15:20:59,333 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:20:59,334 INFO L158 Benchmark]: Toolchain (without parser) took 1697.15ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 112.9MB in the beginning and 158.5MB in the end (delta: -45.6MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2023-12-02 15:20:59,335 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory was 118.5MB in the beginning and 118.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:20:59,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.09ms. Allocated memory is still 153.1MB. Free memory was 112.4MB in the beginning and 100.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 15:20:59,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.42ms. Allocated memory is still 153.1MB. Free memory was 99.8MB in the beginning and 97.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 15:20:59,337 INFO L158 Benchmark]: Boogie Preprocessor took 40.50ms. Allocated memory is still 153.1MB. Free memory was 97.0MB in the beginning and 95.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:20:59,338 INFO L158 Benchmark]: RCFGBuilder took 502.53ms. Allocated memory is still 153.1MB. Free memory was 95.6MB in the beginning and 70.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-12-02 15:20:59,338 INFO L158 Benchmark]: TraceAbstraction took 806.05ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 69.8MB in the beginning and 158.5MB in the end (delta: -88.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:20:59,339 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 201.3MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:20:59,342 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.19ms. Allocated memory is still 153.1MB. Free memory was 118.5MB in the beginning and 118.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.09ms. Allocated memory is still 153.1MB. Free memory was 112.4MB in the beginning and 100.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.42ms. Allocated memory is still 153.1MB. Free memory was 99.8MB in the beginning and 97.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.50ms. Allocated memory is still 153.1MB. Free memory was 97.0MB in the beginning and 95.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 502.53ms. Allocated memory is still 153.1MB. Free memory was 95.6MB in the beginning and 70.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 806.05ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 69.8MB in the beginning and 158.5MB in the end (delta: -88.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 201.3MB. Free memory is still 158.5MB. 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 90, overapproximation of someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 5; [L24] unsigned char var_1_3 = 4; [L25] signed long int var_1_4 = -256; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] double var_1_9 = 9.5; [L31] double var_1_10 = -0.4; [L32] double var_1_11 = 31.5; [L33] double var_1_12 = 16.25; [L34] double var_1_13 = 127.5; [L35] double var_1_14 = 100000.5; [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_2=5, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L97] COND TRUE k_loop < 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L58] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L59] var_1_3 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L61] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L62] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L63] var_1_4 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L64] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L65] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L67] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L70] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L78] var_1_10 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L80] var_1_12 = __VERIFIER_nondet_double() [L81] 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, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L81] 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, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L99] RET updateVariables() [L100] CALL step() [L39] COND FALSE !((var_1_2 / var_1_3) >= var_1_4) [L42] var_1_1 = ((var_1_3 >= var_1_2) && (var_1_7 || var_1_8)) [L44] unsigned char stepLocal_0 = (var_1_6 && var_1_8) || (var_1_2 >= 5); [L45] COND TRUE stepLocal_0 && (var_1_3 < var_1_4) [L46] var_1_9 = var_1_10 [L50] unsigned char stepLocal_1 = var_1_6; [L51] COND TRUE (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || stepLocal_1 [L52] var_1_11 = (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14) [L100] RET step() [L101] CALL, EXPR property() [L90-L91] return ((((var_1_2 / var_1_3) >= var_1_4) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : (var_1_1 == ((unsigned char) ((var_1_3 >= var_1_2) && (var_1_7 || var_1_8))))) && ((((var_1_6 && var_1_8) || (var_1_2 >= 5)) && (var_1_3 < var_1_4)) ? (var_1_9 == ((double) var_1_10)) : (var_1_9 == ((double) var_1_10)))) && (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || var_1_6) ? (var_1_11 == ((double) (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14))) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=2, var_1_11=0, var_1_1=0, var_1_2=5, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=2, var_1_11=0, var_1_1=0, var_1_2=5, var_1_3=2, var_1_4=3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 1, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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-12-02 15:20:59,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3047be65ea0fc5640e4cd865efbd9906b9eaeb4a8d01185b0a8bdb2377eb8eb2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:21:01,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:21:01,375 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 15:21:01,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:21:01,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:21:01,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:21:01,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:21:01,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:21:01,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:21:01,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:21:01,411 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:21:01,411 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:21:01,412 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:21:01,413 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:21:01,413 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:21:01,414 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:21:01,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:21:01,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:21:01,416 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:21:01,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:21:01,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:21:01,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:21:01,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:21:01,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:21:01,421 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:21:01,421 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:21:01,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:21:01,422 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:21:01,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:21:01,423 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:21:01,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:21:01,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:21:01,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:21:01,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:21:01,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:01,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:21:01,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:21:01,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:21:01,425 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:21:01,426 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:21:01,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:21:01,426 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:21:01,426 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:21:01,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:21:01,427 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 3047be65ea0fc5640e4cd865efbd9906b9eaeb4a8d01185b0a8bdb2377eb8eb2 [2023-12-02 15:21:01,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:21:01,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:21:01,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:21:01,722 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:21:01,723 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:21:01,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i [2023-12-02 15:21:04,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:21:04,876 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:21:04,876 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i [2023-12-02 15:21:04,884 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/data/9ff869e26/0aeceebb6c5d4e4ba1d9ca2a27234e18/FLAG331e3299c [2023-12-02 15:21:04,897 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/data/9ff869e26/0aeceebb6c5d4e4ba1d9ca2a27234e18 [2023-12-02 15:21:04,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:21:04,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:21:04,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:04,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:21:04,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:21:04,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:04" (1/1) ... [2023-12-02 15:21:04,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2bbec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:04, skipping insertion in model container [2023-12-02 15:21:04,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:04" (1/1) ... [2023-12-02 15:21:04,942 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:21:05,114 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_58418670-a75a-4f41-9830-be7222ef5b17/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i[915,928] [2023-12-02 15:21:05,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:05,177 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:21:05,193 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-89.i[915,928] [2023-12-02 15:21:05,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:05,239 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:21:05,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05 WrapperNode [2023-12-02 15:21:05,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:05,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:05,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:21:05,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:21:05,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,296 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2023-12-02 15:21:05,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:05,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:21:05,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:21:05,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:21:05,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:21:05,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:21:05,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:21:05,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:21:05,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (1/1) ... [2023-12-02 15:21:05,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:21:05,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:21:05,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:21:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:21:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:21:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 15:21:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 15:21:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:21:05,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:21:05,501 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:21:05,503 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:21:06,237 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:21:06,277 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:21:06,277 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 15:21:06,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:06 BoogieIcfgContainer [2023-12-02 15:21:06,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:21:06,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:21:06,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:21:06,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:21:06,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:21:04" (1/3) ... [2023-12-02 15:21:06,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a714c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:06, skipping insertion in model container [2023-12-02 15:21:06,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:05" (2/3) ... [2023-12-02 15:21:06,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a714c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:06, skipping insertion in model container [2023-12-02 15:21:06,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:06" (3/3) ... [2023-12-02 15:21:06,287 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-89.i [2023-12-02 15:21:06,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:21:06,304 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:21:06,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:21:06,345 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=FINITE_AUTOMATA, 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;@2d3c808, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:21:06,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:21:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 15:21:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 15:21:06,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:06,361 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:21:06,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:06,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1048650967, now seen corresponding path program 1 times [2023-12-02 15:21:06,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683937594] [2023-12-02 15:21:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:06,381 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-12-02 15:21:06,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:06,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:21:06,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:21:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:06,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 15:21:06,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2023-12-02 15:21:06,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:06,680 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:06,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683937594] [2023-12-02 15:21:06,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683937594] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:06,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:06,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:21:06,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459257338] [2023-12-02 15:21:06,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:06,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:21:06,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:06,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:21:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:21:06,721 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-02 15:21:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:06,964 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2023-12-02 15:21:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:21:06,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2023-12-02 15:21:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:06,974 INFO L225 Difference]: With dead ends: 95 [2023-12-02 15:21:06,974 INFO L226 Difference]: Without dead ends: 46 [2023-12-02 15:21:06,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-12-02 15:21:06,981 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 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.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:06,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:21:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-02 15:21:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-02 15:21:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 15:21:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-12-02 15:21:07,027 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 116 [2023-12-02 15:21:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:07,027 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-12-02 15:21:07,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-02 15:21:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-12-02 15:21:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 15:21:07,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:07,032 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:21:07,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:21:07,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:21:07,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:07,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2078404451, now seen corresponding path program 1 times [2023-12-02 15:21:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:07,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095817155] [2023-12-02 15:21:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:07,235 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-12-02 15:21:07,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:07,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:21:07,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:21:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:07,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 15:21:07,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-02 15:21:08,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:21:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-02 15:21:08,369 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:08,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095817155] [2023-12-02 15:21:08,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095817155] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:21:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1137526995] [2023-12-02 15:21:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:08,370 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:21:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:21:08,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:21:08,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-02 15:21:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:09,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:21:09,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2023-12-02 15:21:09,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:21:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-02 15:21:09,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1137526995] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:21:09,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526282958] [2023-12-02 15:21:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:09,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:21:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:21:09,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:21:09,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:21:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:09,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:21:09,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2023-12-02 15:21:09,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:21:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-02 15:21:09,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526282958] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:21:09,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:21:09,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6, 6, 6, 6] total 12 [2023-12-02 15:21:09,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234542436] [2023-12-02 15:21:09,934 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:21:09,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 15:21:09,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:09,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 15:21:09,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:21:09,940 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (36), 3 states have call predecessors, (36), 6 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-12-02 15:21:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:11,065 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2023-12-02 15:21:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:21:11,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (36), 3 states have call predecessors, (36), 6 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 116 [2023-12-02 15:21:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:11,068 INFO L225 Difference]: With dead ends: 101 [2023-12-02 15:21:11,068 INFO L226 Difference]: Without dead ends: 56 [2023-12-02 15:21:11,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 675 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-12-02 15:21:11,071 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:11,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 129 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 15:21:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-02 15:21:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-12-02 15:21:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 15:21:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2023-12-02 15:21:11,088 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 116 [2023-12-02 15:21:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:11,089 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2023-12-02 15:21:11,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (36), 3 states have call predecessors, (36), 6 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2023-12-02 15:21:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2023-12-02 15:21:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 15:21:11,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:11,092 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:21:11,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:21:11,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 15:21:11,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2023-12-02 15:21:11,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:21:11,693 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:11,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2078344869, now seen corresponding path program 1 times [2023-12-02 15:21:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:11,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553871884] [2023-12-02 15:21:11,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:11,694 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-12-02 15:21:11,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:11,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:21:11,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:21:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:11,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 15:21:11,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:10,997 WARN L293 SmtUtils]: Spent 20.01s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 15:23:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-02 15:23:43,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:23:43,625 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:23:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553871884] [2023-12-02 15:23:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553871884] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:23:43,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:23:43,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-02 15:23:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939424224] [2023-12-02 15:23:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:23:43,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 15:23:43,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:23:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 15:23:43,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-02 15:23:43,628 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-02 15:23:52,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 15:23:54,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:16,121 WARN L293 SmtUtils]: Spent 19.38s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 15:24:19,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:24:24,471 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-12-02 15:24:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 15:24:24,511 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 116 [2023-12-02 15:24:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:24:24,513 INFO L225 Difference]: With dead ends: 83 [2023-12-02 15:24:24,513 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 15:24:24,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2023-12-02 15:24:24,516 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 107 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:24:24,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 162 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 17.8s Time] [2023-12-02 15:24:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 15:24:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-12-02 15:24:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 15:24:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2023-12-02 15:24:24,535 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 116 [2023-12-02 15:24:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:24:24,536 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2023-12-02 15:24:24,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-02 15:24:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2023-12-02 15:24:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 15:24:24,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:24:24,539 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:24:24,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 15:24:24,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:24:24,740 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:24:24,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:24:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1268998243, now seen corresponding path program 1 times [2023-12-02 15:24:24,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:24:24,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018027652] [2023-12-02 15:24:24,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:24:24,741 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-12-02 15:24:24,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:24:24,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:24:24,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 15:24:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:24:24,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 15:24:24,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:25:36,572 WARN L293 SmtUtils]: Spent 19.01s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 15:26:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-02 15:26:47,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:26:47,536 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:26:47,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018027652] [2023-12-02 15:26:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018027652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:26:47,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:26:47,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-02 15:26:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752796173] [2023-12-02 15:26:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:26:47,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 15:26:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:26:47,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 15:26:47,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-02 15:26:47,540 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-02 15:26:57,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 15:27:03,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 15:27:06,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 15:27:30,463 WARN L293 SmtUtils]: Spent 22.92s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 15:27:32,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 15:27:36,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 15:27:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:27:37,037 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2023-12-02 15:27:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 15:27:37,087 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 116 [2023-12-02 15:27:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:27:37,088 INFO L225 Difference]: With dead ends: 80 [2023-12-02 15:27:37,088 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 15:27:37,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 54.8s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2023-12-02 15:27:37,090 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 110 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:27:37,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 124 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 23.5s Time] [2023-12-02 15:27:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 15:27:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 15:27:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:27:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 15:27:37,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2023-12-02 15:27:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:27:37,092 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 15:27:37,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-02 15:27:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 15:27:37,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 15:27:37,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 15:27:37,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 15:27:37,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/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-12-02 15:27:37,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 15:27:48,361 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification. DAG size of input: 110 DAG size of output: 56 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 15:27:54,426 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,426 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,427 INFO L895 garLoopResultBuilder]: At program point L97-3(lines 97 103) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,427 INFO L899 garLoopResultBuilder]: For program point L97-4(lines 97 103) no Hoare annotation was computed. [2023-12-02 15:27:54,427 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,428 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,428 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse7 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse4 ((_ zero_extend 24) ~var_1_6~0))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,428 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 55 86) no Hoare annotation was computed. [2023-12-02 15:27:54,428 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-02 15:27:54,429 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-02 15:27:54,429 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_6~0))) (and (bvsle .cse0 (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse2))) (and (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1))) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse2)))))) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-02 15:27:54,429 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-02 15:27:54,429 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-02 15:27:54,429 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-02 15:27:54,430 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,430 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,430 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-02 15:27:54,430 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,431 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,431 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,432 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-02 15:27:54,432 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2023-12-02 15:27:54,432 INFO L899 garLoopResultBuilder]: For program point L45-2(lines 45 49) no Hoare annotation was computed. [2023-12-02 15:27:54,432 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-02 15:27:54,432 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,433 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (bvsge ((_ zero_extend 24) ~var_1_6~0) (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,433 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 15:27:54,433 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-02 15:27:54,433 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-12-02 15:27:54,433 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ zero_extend 24) ~var_1_6~0))) (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.leq ~var_1_12~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.geq ~var_1_12~0 .cse2)))) (bvsle .cse3 (_ bv1 32)) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse2) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (bvsge .cse3 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,433 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-02 15:27:54,434 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_6~0))) (and (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-02 15:27:54,434 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-12-02 15:27:54,434 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 15:27:54,434 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-02 15:27:54,434 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 54) no Hoare annotation was computed. [2023-12-02 15:27:54,434 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,435 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,435 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 53) no Hoare annotation was computed. [2023-12-02 15:27:54,435 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,436 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-02 15:27:54,436 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-02 15:27:54,436 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2023-12-02 15:27:54,436 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-02 15:27:54,436 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-02 15:27:54,436 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-02 15:27:54,437 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-02 15:27:54,437 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-02 15:27:54,440 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-02 15:27:54,442 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:27:54,453 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-02 15:27:54,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:27:54 BoogieIcfgContainer [2023-12-02 15:27:54,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:27:54,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:27:54,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:27:54,455 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:27:54,455 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:06" (3/4) ... [2023-12-02 15:27:54,456 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 15:27:54,459 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-12-02 15:27:54,464 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-12-02 15:27:54,464 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-12-02 15:27:54,464 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 15:27:54,465 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 15:27:54,559 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 15:27:54,559 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 15:27:54,560 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:27:54,561 INFO L158 Benchmark]: Toolchain (without parser) took 409659.59ms. Allocated memory was 104.9MB in the beginning and 612.4MB in the end (delta: 507.5MB). Free memory was 81.0MB in the beginning and 580.0MB in the end (delta: -499.0MB). Peak memory consumption was 371.2MB. Max. memory is 16.1GB. [2023-12-02 15:27:54,561 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 67.1MB. Free memory was 43.4MB in the beginning and 43.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:27:54,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.65ms. Allocated memory is still 104.9MB. Free memory was 80.7MB in the beginning and 67.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 15:27:54,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.65ms. Allocated memory is still 104.9MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:27:54,562 INFO L158 Benchmark]: Boogie Preprocessor took 42.45ms. Allocated memory is still 104.9MB. Free memory was 65.8MB in the beginning and 63.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:27:54,563 INFO L158 Benchmark]: RCFGBuilder took 937.08ms. Allocated memory is still 104.9MB. Free memory was 63.7MB in the beginning and 74.0MB in the end (delta: -10.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-12-02 15:27:54,563 INFO L158 Benchmark]: TraceAbstraction took 408173.52ms. Allocated memory was 104.9MB in the beginning and 612.4MB in the end (delta: 507.5MB). Free memory was 73.4MB in the beginning and 221.8MB in the end (delta: -148.5MB). Peak memory consumption was 362.0MB. Max. memory is 16.1GB. [2023-12-02 15:27:54,563 INFO L158 Benchmark]: Witness Printer took 105.47ms. Allocated memory is still 612.4MB. Free memory was 221.8MB in the beginning and 580.0MB in the end (delta: -358.2MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2023-12-02 15:27:54,566 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.30ms. Allocated memory is still 67.1MB. Free memory was 43.4MB in the beginning and 43.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.65ms. Allocated memory is still 104.9MB. Free memory was 80.7MB in the beginning and 67.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.65ms. Allocated memory is still 104.9MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.45ms. Allocated memory is still 104.9MB. Free memory was 65.8MB in the beginning and 63.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 937.08ms. Allocated memory is still 104.9MB. Free memory was 63.7MB in the beginning and 74.0MB in the end (delta: -10.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 408173.52ms. Allocated memory was 104.9MB in the beginning and 612.4MB in the end (delta: 507.5MB). Free memory was 73.4MB in the beginning and 221.8MB in the end (delta: -148.5MB). Peak memory consumption was 362.0MB. Max. memory is 16.1GB. * Witness Printer took 105.47ms. Allocated memory is still 612.4MB. Free memory was 221.8MB in the beginning and 580.0MB in the end (delta: -358.2MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 408.1s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 91.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 42.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 39.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 941 IncrementalHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 173 mSDtfsCounter, 941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1057 GetRequests, 986 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 107.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=3, InterpolantAutomatonStates: 58, 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, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 77 PreInvPairs, 98 NumberOfFragments, 2539 HoareAnnotationTreeSize, 77 FomulaSimplifications, 4937 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2901 FormulaSimplificationTreeSizeReductionInter, 17.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 296.0s InterpolantComputationTime, 696 NumberOfCodeBlocks, 696 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1035 ConstructedInterpolants, 0 QuantifiedInterpolants, 7382 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1134 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 5973/6156 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((var_1_6 <= 1) && (var_1_6 >= 1)) RESULT: Ultimate proved your program to be correct! [2023-12-02 15:27:54,778 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-12-02 15:27:54,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58418670-a75a-4f41-9830-be7222ef5b17/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE