./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:29:26,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:29:26,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:29:26,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:29:26,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:29:26,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:29:26,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:29:26,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:29:26,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:29:26,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:29:26,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:29:26,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:29:26,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:29:26,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:29:26,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:29:26,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:29:26,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:29:26,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:29:26,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:29:26,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:29:26,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:29:26,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:29:26,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:29:26,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:29:26,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:29:26,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:29:26,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:29:26,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:29:26,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:29:26,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:29:26,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:29:26,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:29:26,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:29:26,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:29:26,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:29:26,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:29:26,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:29:26,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:29:26,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:29:26,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:29:26,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:29:26,573 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:29:26,613 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:29:26,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:29:26,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:29:26,614 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:29:26,614 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:29:26,615 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:29:26,615 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:29:26,615 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:29:26,616 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:29:26,616 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:29:26,616 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:29:26,616 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:29:26,617 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:29:26,617 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:29:26,617 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:29:26,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:29:26,619 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:29:26,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:29:26,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:29:26,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:29:26,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:29:26,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:29:26,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:29:26,621 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:29:26,621 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:29:26,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:29:26,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:29:26,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:29:26,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:29:26,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:29:26,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:29:26,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:29:26,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:29:26,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:29:26,631 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:29:26,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:29:26,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:29:26,633 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:29:26,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:29:26,633 INFO L138 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/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_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2021-11-07 01:29:26,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:29:26,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:29:26,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:29:26,973 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:29:26,973 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:29:26,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-07 01:29:27,065 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data/20bf2dcd8/1ea44e78084d46cca8bf06d2d13a08ae/FLAGe50c81bc5 [2021-11-07 01:29:27,667 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:29:27,667 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-07 01:29:27,675 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data/20bf2dcd8/1ea44e78084d46cca8bf06d2d13a08ae/FLAGe50c81bc5 [2021-11-07 01:29:28,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data/20bf2dcd8/1ea44e78084d46cca8bf06d2d13a08ae [2021-11-07 01:29:28,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:29:28,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:29:28,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:29:28,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:29:28,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:29:28,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6f7dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28, skipping insertion in model container [2021-11-07 01:29:28,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:29:28,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:29:28,275 WARN L228 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-07 01:29:28,286 WARN L228 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-07 01:29:28,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:29:28,304 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:29:28,323 WARN L228 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-07 01:29:28,330 WARN L228 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-07 01:29:28,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:29:28,352 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:29:28,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28 WrapperNode [2021-11-07 01:29:28,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:29:28,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:29:28,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:29:28,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:29:28,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:29:28,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:29:28,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:29:28,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:29:28,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:29:28,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:29:28,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:29:28,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:29:28,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (1/1) ... [2021-11-07 01:29:28,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:29:28,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:29:28,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:29:28,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:29:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:29:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:29:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:29:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:29:28,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:29:28,825 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:29:28,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:29:28 BoogieIcfgContainer [2021-11-07 01:29:28,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:29:28,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:29:28,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:29:28,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:29:28,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:29:28" (1/3) ... [2021-11-07 01:29:28,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e771221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:29:28, skipping insertion in model container [2021-11-07 01:29:28,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:28" (2/3) ... [2021-11-07 01:29:28,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e771221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:29:28, skipping insertion in model container [2021-11-07 01:29:28,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:29:28" (3/3) ... [2021-11-07 01:29:28,840 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2021-11-07 01:29:28,846 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:29:28,846 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 01:29:28,904 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:29:28,911 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:29:28,912 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 01:29:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:29:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:29:28,935 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:29:28,936 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:29:28,937 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:29:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:29:28,944 INFO L85 PathProgramCache]: Analyzing trace with hash -576365883, now seen corresponding path program 1 times [2021-11-07 01:29:28,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:29:28,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060618172] [2021-11-07 01:29:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:29:28,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:29:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:29:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:29:29,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:29:29,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060618172] [2021-11-07 01:29:29,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060618172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:29:29,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:29:29,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:29:29,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130962435] [2021-11-07 01:29:29,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:29:29,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:29:29,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:29:29,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:29:29,314 INFO L87 Difference]: Start difference. First operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:29:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:29:29,430 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2021-11-07 01:29:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:29:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 01:29:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:29:29,442 INFO L225 Difference]: With dead ends: 37 [2021-11-07 01:29:29,443 INFO L226 Difference]: Without dead ends: 29 [2021-11-07 01:29:29,447 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:29:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-07 01:29:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-11-07 01:29:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:29:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-11-07 01:29:29,491 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2021-11-07 01:29:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:29:29,492 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-11-07 01:29:29,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:29:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-11-07 01:29:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:29:29,495 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:29:29,495 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:29:29,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:29:29,496 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:29:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:29:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -508829686, now seen corresponding path program 1 times [2021-11-07 01:29:29,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:29:29,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761564205] [2021-11-07 01:29:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:29:29,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:29:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:29:29,553 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:29:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:29:29,600 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:29:29,605 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:29:29,609 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:29:29,611 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:29:29,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:29:29,616 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-07 01:29:29,620 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:29:29,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:29:29 BoogieIcfgContainer [2021-11-07 01:29:29,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:29:29,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:29:29,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:29:29,687 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:29:29,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:29:28" (3/4) ... [2021-11-07 01:29:29,692 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 01:29:29,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:29:29,695 INFO L168 Benchmark]: Toolchain (without parser) took 1681.34 ms. Allocated memory is still 113.2 MB. Free memory was 76.8 MB in the beginning and 42.8 MB in the end (delta: 34.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 16.1 GB. [2021-11-07 01:29:29,697 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 113.2 MB. Free memory was 86.3 MB in the beginning and 86.3 MB in the end (delta: 28.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:29:29,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.16 ms. Allocated memory is still 113.2 MB. Free memory was 76.6 MB in the beginning and 86.8 MB in the end (delta: -10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:29:29,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 113.2 MB. Free memory was 86.8 MB in the beginning and 85.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:29:29,707 INFO L168 Benchmark]: Boogie Preprocessor took 28.46 ms. Allocated memory is still 113.2 MB. Free memory was 85.2 MB in the beginning and 84.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:29:29,709 INFO L168 Benchmark]: RCFGBuilder took 399.43 ms. Allocated memory is still 113.2 MB. Free memory was 83.6 MB in the beginning and 71.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:29:29,710 INFO L168 Benchmark]: TraceAbstraction took 853.07 ms. Allocated memory is still 113.2 MB. Free memory was 70.6 MB in the beginning and 43.3 MB in the end (delta: 27.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:29:29,710 INFO L168 Benchmark]: Witness Printer took 7.85 ms. Allocated memory is still 113.2 MB. Free memory was 43.3 MB in the beginning and 42.8 MB in the end (delta: 540.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:29:29,720 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 113.2 MB. Free memory was 86.3 MB in the beginning and 86.3 MB in the end (delta: 28.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 339.16 ms. Allocated memory is still 113.2 MB. Free memory was 76.6 MB in the beginning and 86.8 MB in the end (delta: -10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 113.2 MB. Free memory was 86.8 MB in the beginning and 85.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.46 ms. Allocated memory is still 113.2 MB. Free memory was 85.2 MB in the beginning and 84.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 399.43 ms. Allocated memory is still 113.2 MB. Free memory was 83.6 MB in the beginning and 71.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 853.07 ms. Allocated memory is still 113.2 MB. Free memory was 70.6 MB in the beginning and 43.3 MB in the end (delta: 27.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Witness Printer took 7.85 ms. Allocated memory is still 113.2 MB. Free memory was 43.3 MB in the beginning and 42.8 MB in the end (delta: 540.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * 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: 58]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of to_real at line 41, overapproximation of someBinaryArithmeticDOUBLEoperation at line 173. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __return_134; [L19] double main__E0; [L20] double main__E1; [L21] double main__S; [L22] int main__i; [L23] main__E1 = 0 [L24] main__S = 0 [L25] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L26] COND TRUE main__i <= 1000000 [L28] main__E0 = __VERIFIER_nondet_double() [L29] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L30] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L32] COND TRUE main__E0 <= 1.0 [L34] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L35] COND TRUE main____CPAchecker_TMP_0 != 0 [L37] int main____CPAchecker_TMP_1; [L38] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L39] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L41] main__S = 0 [L43] main__E1 = main__E0 [L44] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L45] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L162] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L52] int __tmp_1; [L53] __tmp_1 = main____CPAchecker_TMP_2 [L54] int __VERIFIER_assert__cond; [L55] __VERIFIER_assert__cond = __tmp_1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L56] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L58] reach_error() VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] - UnprovableResult [Line: 104]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 35 SDtfs, 37 SDslu, 68 SDs, 0 SdLazy, 16 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 [2021-11-07 01:29:29,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:29:32,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:29:32,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:29:32,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:29:32,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:29:32,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:29:32,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:29:32,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:29:32,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:29:32,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:29:32,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:29:32,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:29:32,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:29:32,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:29:32,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:29:32,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:29:32,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:29:32,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:29:32,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:29:32,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:29:32,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:29:32,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:29:32,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:29:32,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:29:32,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:29:32,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:29:32,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:29:32,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:29:32,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:29:32,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:29:32,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:29:32,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:29:32,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:29:32,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:29:32,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:29:32,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:29:32,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:29:32,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:29:32,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:29:32,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:29:32,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:29:32,730 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-07 01:29:32,777 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:29:32,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:29:32,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:29:32,780 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:29:32,780 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:29:32,780 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:29:32,781 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:29:32,781 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:29:32,782 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:29:32,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:29:32,785 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:29:32,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:29:32,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:29:32,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:29:32,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:29:32,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:29:32,787 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:29:32,788 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 01:29:32,788 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 01:29:32,788 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:29:32,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:29:32,789 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:29:32,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:29:32,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:29:32,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 01:29:32,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:29:32,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:29:32,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:29:32,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:29:32,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:29:32,793 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 01:29:32,793 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 01:29:32,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:29:32,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:29:32,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:29:32,795 INFO L138 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/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_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2021-11-07 01:29:33,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:29:33,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:29:33,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:29:33,318 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:29:33,319 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:29:33,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-07 01:29:33,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data/b01b028a5/9bc435663b19493ba77f3db72554d0f7/FLAG4841a3532 [2021-11-07 01:29:34,063 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:29:34,064 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2021-11-07 01:29:34,072 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data/b01b028a5/9bc435663b19493ba77f3db72554d0f7/FLAG4841a3532 [2021-11-07 01:29:34,416 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/data/b01b028a5/9bc435663b19493ba77f3db72554d0f7 [2021-11-07 01:29:34,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:29:34,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:29:34,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:29:34,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:29:34,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:29:34,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:34,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adb45ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34, skipping insertion in model container [2021-11-07 01:29:34,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:34,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:29:34,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:29:34,730 WARN L228 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-07 01:29:34,754 WARN L228 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-07 01:29:34,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:29:34,804 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:29:34,880 WARN L228 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2021-11-07 01:29:34,896 WARN L228 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_9726dfbb-ee22-4e9d-9939-5012da4c2405/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2021-11-07 01:29:34,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:29:34,958 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:29:34,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34 WrapperNode [2021-11-07 01:29:34,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:29:34,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:29:34,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:29:34,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:29:34,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:34,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:35,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:29:35,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:29:35,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:29:35,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:29:35,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:35,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:35,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:35,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:35,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:35,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:35,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:35,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:29:35,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:29:35,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:29:35,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:29:35,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (1/1) ... [2021-11-07 01:29:35,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:29:35,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:29:35,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:29:35,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:29:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 01:29:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:29:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:29:35,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:29:39,816 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:29:39,816 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:29:39,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:29:39 BoogieIcfgContainer [2021-11-07 01:29:39,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:29:39,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:29:39,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:29:39,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:29:39,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:29:34" (1/3) ... [2021-11-07 01:29:39,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@870b13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:29:39, skipping insertion in model container [2021-11-07 01:29:39,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:29:34" (2/3) ... [2021-11-07 01:29:39,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@870b13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:29:39, skipping insertion in model container [2021-11-07 01:29:39,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:29:39" (3/3) ... [2021-11-07 01:29:39,851 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2021-11-07 01:29:39,865 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:29:39,865 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 01:29:39,927 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:29:39,935 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:29:39,935 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 01:29:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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) [2021-11-07 01:29:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:29:39,958 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:29:39,959 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:29:39,959 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:29:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:29:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2021-11-07 01:29:39,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:29:39,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095548228] [2021-11-07 01:29:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:29:39,984 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:29:39,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:29:39,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:29:39,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 01:29:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:29:40,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 01:29:40,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:29:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:29:40,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:29:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:29:40,401 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:29:40,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095548228] [2021-11-07 01:29:40,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095548228] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:29:40,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:29:40,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 01:29:40,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625753527] [2021-11-07 01:29:40,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:29:40,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:29:40,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:29:40,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:29:40,429 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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) Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-11-07 01:29:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:29:40,553 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2021-11-07 01:29:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:29:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:29:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:29:40,568 INFO L225 Difference]: With dead ends: 62 [2021-11-07 01:29:40,569 INFO L226 Difference]: Without dead ends: 48 [2021-11-07 01:29:40,573 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:29:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-07 01:29:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2021-11-07 01:29:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:29:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-11-07 01:29:40,637 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2021-11-07 01:29:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:29:40,638 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-11-07 01:29:40,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-11-07 01:29:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-11-07 01:29:40,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:29:40,640 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:29:40,641 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:29:40,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:29:40,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:29:40,864 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:29:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:29:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2021-11-07 01:29:40,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:29:40,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381900261] [2021-11-07 01:29:40,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:29:40,873 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:29:40,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:29:40,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:29:40,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 01:29:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:29:40,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:29:40,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:29:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:29:41,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:29:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:29:41,233 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:29:41,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381900261] [2021-11-07 01:29:41,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381900261] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:29:41,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:29:41,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 01:29:41,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061753390] [2021-11-07 01:29:41,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:29:41,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:29:41,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:29:41,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:29:41,237 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-11-07 01:29:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:29:43,987 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2021-11-07 01:29:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:29:43,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:29:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:29:43,989 INFO L225 Difference]: With dead ends: 88 [2021-11-07 01:29:43,989 INFO L226 Difference]: Without dead ends: 68 [2021-11-07 01:29:43,990 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:29:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-07 01:29:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 38. [2021-11-07 01:29:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 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) [2021-11-07 01:29:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-11-07 01:29:44,001 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2021-11-07 01:29:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:29:44,002 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-11-07 01:29:44,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-11-07 01:29:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-11-07 01:29:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:29:44,003 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:29:44,003 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:29:44,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-07 01:29:44,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:29:44,214 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:29:44,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:29:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1349105153, now seen corresponding path program 1 times [2021-11-07 01:29:44,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:29:44,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530283434] [2021-11-07 01:29:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:29:44,217 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:29:44,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:29:44,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:29:44,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 01:29:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:29:44,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 01:29:44,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:29:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:29:45,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:29:51,785 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-07 01:29:53,830 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-07 01:30:08,249 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2021-11-07 01:30:10,295 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-11-07 01:30:24,816 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) is different from true [2021-11-07 01:30:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:30:37,363 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:30:37,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530283434] [2021-11-07 01:30:37,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530283434] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:30:37,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:30:37,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-07 01:30:37,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113769861] [2021-11-07 01:30:37,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 01:30:37,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:30:37,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 01:30:37,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=30, Unknown=5, NotChecked=42, Total=110 [2021-11-07 01:30:37,366 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:30:39,686 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (= .cse1 c_ULTIMATE.start_main_~main__E1~0) (= .cse1 c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 01:30:41,751 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)) (= .cse1 c_ULTIMATE.start_main_~main__E1~0) (= .cse1 c_ULTIMATE.start_main_~main__S~0) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 01:30:43,810 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse0) (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (= .cse1 c_ULTIMATE.start_main_~main__E1~0) (= .cse1 c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 01:30:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:30:47,177 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2021-11-07 01:30:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:30:47,178 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:30:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:30:47,179 INFO L225 Difference]: With dead ends: 84 [2021-11-07 01:30:47,179 INFO L226 Difference]: Without dead ends: 61 [2021-11-07 01:30:47,180 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=8, NotChecked=102, Total=182 [2021-11-07 01:30:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-07 01:30:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 30. [2021-11-07 01:30:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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) [2021-11-07 01:30:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-11-07 01:30:47,192 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 13 [2021-11-07 01:30:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:30:47,193 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-11-07 01:30:47,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:30:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-11-07 01:30:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:30:47,194 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:30:47,194 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:30:47,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:30:47,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:30:47,395 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:30:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:30:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash -151896705, now seen corresponding path program 1 times [2021-11-07 01:30:47,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:30:47,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769607025] [2021-11-07 01:30:47,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:30:47,402 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:30:47,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:30:47,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:30:47,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 01:30:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:30:47,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:30:47,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:30:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:30:47,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:30:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:30:47,692 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:30:47,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769607025] [2021-11-07 01:30:47,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769607025] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:30:47,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:30:47,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 01:30:47,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872480291] [2021-11-07 01:30:47,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:30:47,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:30:47,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:30:47,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:30:47,695 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:30:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:30:47,728 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2021-11-07 01:30:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:30:47,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:30:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:30:47,730 INFO L225 Difference]: With dead ends: 49 [2021-11-07 01:30:47,730 INFO L226 Difference]: Without dead ends: 29 [2021-11-07 01:30:47,731 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:30:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-07 01:30:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-07 01:30:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:30:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-11-07 01:30:47,738 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2021-11-07 01:30:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:30:47,738 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-07 01:30:47,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:30:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-11-07 01:30:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:30:47,740 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:30:47,740 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:30:47,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:30:47,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:30:47,955 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:30:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:30:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2021-11-07 01:30:47,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:30:47,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149679407] [2021-11-07 01:30:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:30:47,957 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:30:47,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:30:47,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:30:47,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 01:30:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:30:48,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 01:30:48,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:30:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:30:48,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:30:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:30:48,322 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:30:48,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149679407] [2021-11-07 01:30:48,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149679407] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:30:48,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:30:48,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 01:30:48,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59817449] [2021-11-07 01:30:48,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:30:48,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:30:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:30:48,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:30:48,326 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2021-11-07 01:30:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:30:48,529 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2021-11-07 01:30:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:30:48,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:30:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:30:48,530 INFO L225 Difference]: With dead ends: 63 [2021-11-07 01:30:48,531 INFO L226 Difference]: Without dead ends: 61 [2021-11-07 01:30:48,531 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:30:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-07 01:30:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2021-11-07 01:30:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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) [2021-11-07 01:30:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-11-07 01:30:48,544 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2021-11-07 01:30:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:30:48,544 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-11-07 01:30:48,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2021-11-07 01:30:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-11-07 01:30:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:30:48,546 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:30:48,546 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:30:48,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-07 01:30:48,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:30:48,760 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:30:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:30:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2021-11-07 01:30:48,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:30:48,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760872495] [2021-11-07 01:30:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:30:48,762 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:30:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:30:48,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:30:48,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-07 01:30:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:30:49,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 01:30:49,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:31:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:31:28,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:31:36,519 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-07 01:31:38,565 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-07 01:31:52,983 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2021-11-07 01:31:55,033 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-11-07 01:32:09,519 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) is different from true [2021-11-07 01:33:38,885 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__E0~0_21 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_21 (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_21) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_21 .cse0))))) is different from true [2021-11-07 01:34:01,618 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~main__E0~0_21 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_21 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_21) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-11-07 01:34:19,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (forall ((v_ULTIMATE.start_main_~main__E0~0_21 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_21 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_21) ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) is different from false [2021-11-07 01:34:21,555 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (forall ((v_ULTIMATE.start_main_~main__E0~0_21 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_21 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_21) ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) is different from true [2021-11-07 01:34:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:34:55,041 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:34:55,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760872495] [2021-11-07 01:34:55,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760872495] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:34:55,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:34:55,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2021-11-07 01:34:55,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97992631] [2021-11-07 01:34:55,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 01:34:55,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:34:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 01:34:55,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=82, Unknown=17, NotChecked=150, Total=306 [2021-11-07 01:34:55,045 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 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) [2021-11-07 01:34:59,319 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (forall ((v_ULTIMATE.start_main_~main__E0~0_21 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_21 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_21) ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:35:20,086 WARN L207 SmtUtils]: Spent 7.89 s on a formula simplification that was a NOOP. DAG size: 28 [2021-11-07 01:35:37,347 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((v_ULTIMATE.start_main_~main__E0~0_21 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_21 (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) v_ULTIMATE.start_main_~main__E0~0_21) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_21 .cse0))))) (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse1) (forall ((v_ULTIMATE.start_main_~main__E0~0_21 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~main__E0~0_21 (fp.neg .cse2))) (not (fp.leq v_ULTIMATE.start_main_~main__E0~0_21 .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) v_ULTIMATE.start_main_~main__E0~0_21) c_ULTIMATE.start_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) (fp.geq c_ULTIMATE.start_main_~main__E0~0 (fp.neg .cse1)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 01:35:41,912 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse1) (fp.geq c_ULTIMATE.start_main_~main__E1~0 (fp.neg .cse1)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 01:35:50,814 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse0) (fp.geq c_ULTIMATE.start_main_~main__E1~0 .cse1) (fp.geq c_ULTIMATE.start_main_~main__E0~0 .cse1) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-07 01:35:53,573 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse0) (fp.leq c_ULTIMATE.start_main_~main__E0~0 .cse0) (fp.geq c_ULTIMATE.start_main_~main__E1~0 .cse1) (fp.geq c_ULTIMATE.start_main_~main__E0~0 .cse1) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-07 01:37:14,930 WARN L207 SmtUtils]: Spent 10.10 s on a formula simplification that was a NOOP. DAG size: 33 [2021-11-07 01:37:28,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2))) (and (exists ((ULTIMATE.start_main_~main__E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (= c_ULTIMATE.start_main_~main__S~0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) ULTIMATE.start_main_~main__E0~0) ULTIMATE.start_main_~main__E1~0)) (fp.leq ULTIMATE.start_main_~main__E1~0 .cse0) (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0) (fp.geq ULTIMATE.start_main_~main__E1~0 .cse1) (fp.geq ULTIMATE.start_main_~main__E0~0 .cse1))))) (fp.leq c_ULTIMATE.start_main_~main__E1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~main__E1~0 .cse3) (fp.geq c_ULTIMATE.start_main_~main__E0~0 .cse3) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~main__S~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-07 01:37:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:37:37,408 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2021-11-07 01:37:37,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 01:37:37,421 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:37:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:37:37,422 INFO L225 Difference]: With dead ends: 86 [2021-11-07 01:37:37,422 INFO L226 Difference]: Without dead ends: 67 [2021-11-07 01:37:37,423 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 127.6s TimeCoverageRelationStatistics Valid=121, Invalid=197, Unknown=36, NotChecked=516, Total=870 [2021-11-07 01:37:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-07 01:37:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-11-07 01:37:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 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) [2021-11-07 01:37:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2021-11-07 01:37:37,439 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 24 [2021-11-07 01:37:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:37:37,439 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2021-11-07 01:37:37,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 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) [2021-11-07 01:37:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2021-11-07 01:37:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:37:37,441 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:37:37,441 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:37:37,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-07 01:37:37,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:37:37,656 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:37:37,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:37:37,656 INFO L85 PathProgramCache]: Analyzing trace with hash -60423724, now seen corresponding path program 1 times [2021-11-07 01:37:37,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:37:37,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390916562] [2021-11-07 01:37:37,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:37:37,658 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:37:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:37:37,660 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:37:37,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9726dfbb-ee22-4e9d-9939-5012da4c2405/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-07 01:37:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:37:39,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-07 01:37:39,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:38:27,364 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse0))) (and (fp.leq ULTIMATE.start_main_~main__E1~0 .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse1 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) ULTIMATE.start_main_~main__E1~0) .cse2)))) ULTIMATE.start_main_~main__E0~0) ULTIMATE.start_main_~main__E1~0) c_ULTIMATE.start_main_~main__S~0) (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0) (fp.geq ULTIMATE.start_main_~main__E1~0 .cse3) (fp.geq ULTIMATE.start_main_~main__E0~0 .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 01:39:56,721 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.neg .cse0))) (and (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) ULTIMATE.start_main_~main__E1~0) .cse2)))) ULTIMATE.start_main_~main__E0~0) ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq ULTIMATE.start_main_~main__E1~0 .cse0) (fp.geq ULTIMATE.start_main_~main__E1~0 .cse3) (fp.geq ULTIMATE.start_main_~main__E0~0 .cse3))))) is different from false [2021-11-07 01:39:58,755 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.neg .cse0))) (and (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) ULTIMATE.start_main_~main__E1~0) .cse2)))) ULTIMATE.start_main_~main__E0~0) ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq ULTIMATE.start_main_~main__E1~0 .cse0) (fp.geq ULTIMATE.start_main_~main__E1~0 .cse3) (fp.geq ULTIMATE.start_main_~main__E0~0 .cse3))))) is different from true [2021-11-07 01:42:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:42:19,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:42:26,071 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2021-11-07 01:42:28,130 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2021-11-07 01:42:42,612 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2021-11-07 01:42:44,670 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) c_ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq c_ULTIMATE.start_main_~main__E0~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-11-07 01:42:59,246 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) c_ULTIMATE.start_main_~main__S~0) ULTIMATE.start_main_~main__E0~0) c_ULTIMATE.start_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq ULTIMATE.start_main_~main__E0~0 .cse0)) (not (fp.geq ULTIMATE.start_main_~main__E0~0 (fp.neg .cse0)))))) is different from true