./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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 ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:14:50,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:14:50,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:14:50,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:14:50,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:14:50,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:14:50,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:14:50,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:14:50,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:14:50,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:14:50,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:14:50,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:14:50,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:14:50,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:14:50,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:14:50,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:14:50,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:14:50,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:14:50,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:14:50,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:14:50,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:14:50,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:14:50,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:14:50,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:14:50,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:14:50,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:14:50,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:14:50,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:14:50,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:14:50,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:14:50,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:14:50,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:14:50,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:14:50,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:14:50,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:14:50,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:14:50,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:14:50,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:14:50,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:14:50,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:14:50,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:14:50,614 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:14:50,678 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:14:50,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:14:50,680 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:14:50,681 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:14:50,681 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:14:50,681 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:14:50,682 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:14:50,682 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:14:50,682 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:14:50,683 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:14:50,684 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:14:50,684 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:14:50,685 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:14:50,685 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:14:50,685 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:14:50,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:14:50,687 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:14:50,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:14:50,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:14:50,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:14:50,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:14:50,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:14:50,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:14:50,689 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:14:50,689 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:14:50,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:14:50,690 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:14:50,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:14:50,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:14:50,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:14:50,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:14:50,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:14:50,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:14:50,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:14:50,701 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:14:50,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:14:50,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:14:50,702 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:14:50,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:14:50,702 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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 -> ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 [2021-11-07 01:14:51,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:14:51,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:14:51,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:14:51,071 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:14:51,072 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:14:51,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2021-11-07 01:14:51,153 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data/9690e374b/9b954fe69bed4959bba9ed143edb699a/FLAGeb2ad2da4 [2021-11-07 01:14:51,804 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:14:51,805 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2021-11-07 01:14:51,813 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data/9690e374b/9b954fe69bed4959bba9ed143edb699a/FLAGeb2ad2da4 [2021-11-07 01:14:52,101 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data/9690e374b/9b954fe69bed4959bba9ed143edb699a [2021-11-07 01:14:52,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:14:52,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:14:52,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:14:52,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:14:52,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:14:52,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edc4688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52, skipping insertion in model container [2021-11-07 01:14:52,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:14:52,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:14:52,361 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2021-11-07 01:14:52,372 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2021-11-07 01:14:52,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:14:52,392 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:14:52,414 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2021-11-07 01:14:52,420 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2021-11-07 01:14:52,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:14:52,454 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:14:52,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52 WrapperNode [2021-11-07 01:14:52,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:14:52,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:14:52,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:14:52,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:14:52,474 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:14:52" (1/1) ... [2021-11-07 01:14:52,483 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:14:52" (1/1) ... [2021-11-07 01:14:52,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:14:52,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:14:52,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:14:52,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:14:52,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:14:52,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:14:52,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:14:52,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:14:52,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52" (1/1) ... [2021-11-07 01:14:52,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:14:52,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:14:52,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:14:52,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:14:52,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:14:52,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:14:52,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:14:52,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:14:53,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:14:53,079 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:14:53,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:14:53 BoogieIcfgContainer [2021-11-07 01:14:53,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:14:53,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:14:53,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:14:53,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:14:53,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:14:52" (1/3) ... [2021-11-07 01:14:53,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a414b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:14:53, skipping insertion in model container [2021-11-07 01:14:53,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:52" (2/3) ... [2021-11-07 01:14:53,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a414b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:14:53, skipping insertion in model container [2021-11-07 01:14:53,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:14:53" (3/3) ... [2021-11-07 01:14:53,094 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+nlh-reducer.c [2021-11-07 01:14:53,101 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:14:53,116 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 01:14:53,176 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:14:53,184 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:14:53,184 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 01:14:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 25 states have (on average 1.64) internal successors, (41), 27 states have internal predecessors, (41), 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:14:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:14:53,205 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:14:53,206 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:14:53,206 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:14:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:14:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -912134591, now seen corresponding path program 1 times [2021-11-07 01:14:53,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:14:53,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336890126] [2021-11-07 01:14:53,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:14:53,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:14:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:14:53,490 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:14:53,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:14:53,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336890126] [2021-11-07 01:14:53,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336890126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:14:53,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:14:53,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:14:53,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970952191] [2021-11-07 01:14:53,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:14:53,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:14:53,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:14:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:14:53,520 INFO L87 Difference]: Start difference. First operand has 28 states, 25 states have (on average 1.64) internal successors, (41), 27 states have internal predecessors, (41), 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:14:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:14:53,651 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2021-11-07 01:14:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:14:53,654 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:14:53,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:14:53,665 INFO L225 Difference]: With dead ends: 39 [2021-11-07 01:14:53,665 INFO L226 Difference]: Without dead ends: 29 [2021-11-07 01:14:53,671 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:14:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-07 01:14:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-11-07 01:14:53,718 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:14:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-11-07 01:14:53,723 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2021-11-07 01:14:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:14:53,724 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-11-07 01:14:53,724 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:14:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-11-07 01:14:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:14:53,726 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:14:53,726 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:14:53,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:14:53,727 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:14:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:14:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash -842691770, now seen corresponding path program 1 times [2021-11-07 01:14:53,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:14:53,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011830335] [2021-11-07 01:14:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:14:53,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:14:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:14:53,792 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:14:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:14:53,866 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:14:53,866 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:14:53,869 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:14:53,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:14:53,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:14:53,877 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-07 01:14:53,880 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:14:53,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:14:53 BoogieIcfgContainer [2021-11-07 01:14:53,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:14:53,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:14:53,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:14:53,916 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:14:53,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:14:53" (3/4) ... [2021-11-07 01:14:53,920 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 01:14:53,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:14:53,923 INFO L168 Benchmark]: Toolchain (without parser) took 1816.10 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 58.6 MB in the beginning and 59.4 MB in the end (delta: -796.8 kB). Peak memory consumption was 17.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:14:53,924 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 81.8 MB. Free memory is still 56.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:14:53,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.83 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 58.4 MB in the beginning and 75.5 MB in the end (delta: -17.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:14:53,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.89 ms. Allocated memory is still 100.7 MB. Free memory was 75.5 MB in the beginning and 73.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:14:53,927 INFO L168 Benchmark]: Boogie Preprocessor took 36.13 ms. Allocated memory is still 100.7 MB. Free memory was 73.9 MB in the beginning and 72.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:14:53,927 INFO L168 Benchmark]: RCFGBuilder took 517.33 ms. Allocated memory is still 100.7 MB. Free memory was 72.6 MB in the beginning and 59.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:14:53,928 INFO L168 Benchmark]: TraceAbstraction took 829.81 ms. Allocated memory is still 100.7 MB. Free memory was 59.2 MB in the beginning and 59.7 MB in the end (delta: -527.0 kB). Peak memory consumption was 162.0 kB. Max. memory is 16.1 GB. [2021-11-07 01:14:53,929 INFO L168 Benchmark]: Witness Printer took 5.38 ms. Allocated memory is still 100.7 MB. Free memory was 59.7 MB in the beginning and 59.4 MB in the end (delta: 390.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:14:53,934 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.36 ms. Allocated memory is still 81.8 MB. Free memory is still 56.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.83 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 58.4 MB in the beginning and 75.5 MB in the end (delta: -17.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.89 ms. Allocated memory is still 100.7 MB. Free memory was 75.5 MB in the beginning and 73.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.13 ms. Allocated memory is still 100.7 MB. Free memory was 73.9 MB in the beginning and 72.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 517.33 ms. Allocated memory is still 100.7 MB. Free memory was 72.6 MB in the beginning and 59.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 829.81 ms. Allocated memory is still 100.7 MB. Free memory was 59.2 MB in the beginning and 59.7 MB in the end (delta: -527.0 kB). Peak memory consumption was 162.0 kB. Max. memory is 16.1 GB. * Witness Printer took 5.38 ms. Allocated memory is still 100.7 MB. Free memory was 59.7 MB in the beginning and 59.4 MB in the end (delta: 390.9 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: 59]: 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 46, overapproximation of to_real at line 42, overapproximation of someBinaryArithmeticDOUBLEoperation at line 177. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __tmp_112_0; [L17] int __return_134; [L20] double main__E0; [L21] double main__E1; [L22] double main__S; [L23] int main__i; [L24] main__E1 = 0 [L25] main__S = 0 [L26] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L27] COND TRUE main__i <= 1000000 [L29] main__E0 = __VERIFIER_nondet_double() [L30] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L31] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L33] COND TRUE main__E0 <= 1.0 [L35] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L36] COND TRUE main____CPAchecker_TMP_0 != 0 [L38] int main____CPAchecker_TMP_1; [L39] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L40] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L42] main__S = 0 [L44] main__E1 = main__E0 [L45] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L46] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L166] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L53] int __tmp_1; [L54] __tmp_1 = main____CPAchecker_TMP_2 [L55] int __VERIFIER_assert__cond; [L56] __VERIFIER_assert__cond = __tmp_1 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L57] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L59] reach_error() VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] - UnprovableResult [Line: 105]: 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, 28 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: 36 SDtfs, 38 SDslu, 70 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=28occurred 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:14:53,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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 ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:14:57,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:14:57,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:14:57,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:14:57,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:14:57,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:14:57,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:14:57,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:14:57,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:14:57,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:14:57,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:14:57,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:14:57,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:14:57,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:14:57,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:14:57,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:14:57,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:14:57,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:14:57,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:14:57,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:14:57,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:14:57,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:14:57,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:14:57,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:14:57,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:14:57,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:14:57,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:14:57,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:14:57,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:14:57,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:14:57,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:14:57,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:14:57,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:14:57,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:14:57,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:14:57,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:14:57,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:14:57,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:14:57,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:14:57,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:14:57,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:14:57,200 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-07 01:14:57,247 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:14:57,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:14:57,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:14:57,249 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:14:57,249 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:14:57,249 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:14:57,250 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:14:57,250 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:14:57,250 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:14:57,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:14:57,251 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:14:57,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:14:57,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:14:57,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:14:57,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:14:57,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:14:57,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:14:57,255 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 01:14:57,255 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 01:14:57,255 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:14:57,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:14:57,255 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:14:57,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:14:57,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:14:57,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 01:14:57,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:14:57,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:14:57,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:14:57,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:14:57,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:14:57,259 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 01:14:57,259 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 01:14:57,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:14:57,260 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:14:57,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:14:57,261 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/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 -> ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 [2021-11-07 01:14:57,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:14:57,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:14:57,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:14:57,761 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:14:57,762 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:14:57,763 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2021-11-07 01:14:57,841 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data/da99f1439/910cf02c6c664c76ac37ac2f0c4e6396/FLAGad759754a [2021-11-07 01:14:58,467 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:14:58,473 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2021-11-07 01:14:58,485 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data/da99f1439/910cf02c6c664c76ac37ac2f0c4e6396/FLAGad759754a [2021-11-07 01:14:58,805 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/data/da99f1439/910cf02c6c664c76ac37ac2f0c4e6396 [2021-11-07 01:14:58,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:14:58,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:14:58,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:14:58,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:14:58,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:14:58,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:58" (1/1) ... [2021-11-07 01:14:58,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793407bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:58, skipping insertion in model container [2021-11-07 01:14:58,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:58" (1/1) ... [2021-11-07 01:14:58,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:14:58,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:14:59,138 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2021-11-07 01:14:59,164 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2021-11-07 01:14:59,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:14:59,212 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:14:59,277 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2021-11-07 01:14:59,307 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_b17465ee-0f26-4070-b9fc-fdd3340e4af4/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2021-11-07 01:14:59,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:14:59,330 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:14:59,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59 WrapperNode [2021-11-07 01:14:59,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:14:59,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:14:59,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:14:59,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:14:59,342 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:14:59" (1/1) ... [2021-11-07 01:14:59,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:14:59" (1/1) ... [2021-11-07 01:14:59,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:14:59,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:14:59,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:14:59,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:14:59,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59" (1/1) ... [2021-11-07 01:14:59,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59" (1/1) ... [2021-11-07 01:14:59,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59" (1/1) ... [2021-11-07 01:14:59,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59" (1/1) ... [2021-11-07 01:14:59,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59" (1/1) ... [2021-11-07 01:14:59,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59" (1/1) ... [2021-11-07 01:14:59,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59" (1/1) ... [2021-11-07 01:14:59,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:14:59,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:14:59,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:14:59,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:14:59,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59" (1/1) ... [2021-11-07 01:14:59,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:14:59,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:14:59,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:14:59,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:14:59,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 01:14:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:14:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:14:59,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:15:04,250 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:15:04,250 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:15:04,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:04 BoogieIcfgContainer [2021-11-07 01:15:04,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:15:04,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:15:04,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:15:04,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:15:04,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:14:58" (1/3) ... [2021-11-07 01:15:04,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d146715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:04, skipping insertion in model container [2021-11-07 01:15:04,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:59" (2/3) ... [2021-11-07 01:15:04,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d146715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:04, skipping insertion in model container [2021-11-07 01:15:04,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:04" (3/3) ... [2021-11-07 01:15:04,276 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+nlh-reducer.c [2021-11-07 01:15:04,283 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:15:04,284 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 01:15:04,346 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:15:04,352 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:15:04,353 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 01:15:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 states have internal predecessors, (49), 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:15:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:15:04,380 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:15:04,381 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:15:04,383 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:15:04,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:15:04,413 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2021-11-07 01:15:04,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:15:04,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593328838] [2021-11-07 01:15:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:15:04,430 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:15:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:15:04,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:15:04,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 01:15:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:15:04,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 01:15:04,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:15:04,810 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:15:04,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:15:04,958 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:15:04,959 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:15:04,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593328838] [2021-11-07 01:15:04,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593328838] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:15:04,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:15:04,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 01:15:04,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783610522] [2021-11-07 01:15:04,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:15:04,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:15:04,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:15:04,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:15:04,992 INFO L87 Difference]: Start difference. First operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 states have internal predecessors, (49), 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:15:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:15:05,163 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2021-11-07 01:15:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:15:05,167 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:15:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:15:05,177 INFO L225 Difference]: With dead ends: 65 [2021-11-07 01:15:05,178 INFO L226 Difference]: Without dead ends: 48 [2021-11-07 01:15:05,182 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:15:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-07 01:15:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2021-11-07 01:15:05,234 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:15:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-11-07 01:15:05,239 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2021-11-07 01:15:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:15:05,241 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-11-07 01:15:05,241 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:15:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-11-07 01:15:05,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:15:05,244 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:15:05,244 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:15:05,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:15:05,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:15:05,457 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:15:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:15:05,459 INFO L85 PathProgramCache]: Analyzing trace with hash 845201395, now seen corresponding path program 1 times [2021-11-07 01:15:05,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:15:05,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617162445] [2021-11-07 01:15:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:15:05,460 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:15:05,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:15:05,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:15:05,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 01:15:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:15:05,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:15:05,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:15:05,696 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:15:05,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:15:05,817 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:15:05,818 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:15:05,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617162445] [2021-11-07 01:15:05,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617162445] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:15:05,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:15:05,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 01:15:05,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559110495] [2021-11-07 01:15:05,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:15:05,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:15:05,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:15:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:15:05,829 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:15:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:15:08,402 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2021-11-07 01:15:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:15:08,405 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:15:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:15:08,406 INFO L225 Difference]: With dead ends: 88 [2021-11-07 01:15:08,407 INFO L226 Difference]: Without dead ends: 68 [2021-11-07 01:15:08,408 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:15:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-07 01:15:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 38. [2021-11-07 01:15:08,417 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:15:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-11-07 01:15:08,419 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2021-11-07 01:15:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:15:08,419 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-11-07 01:15:08,420 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:15:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-11-07 01:15:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:15:08,421 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:15:08,421 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:15:08,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:15:08,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:15:08,644 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:15:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:15:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1168948157, now seen corresponding path program 1 times [2021-11-07 01:15:08,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:15:08,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790718492] [2021-11-07 01:15:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:15:08,646 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:15:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:15:08,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:15:08,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 01:15:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:15:09,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 01:15:09,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:15:10,133 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:15:10,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:15:16,400 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:15:18,457 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:15:32,918 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:15:34,969 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:15:49,520 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:16:02,068 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:16:02,069 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:16:02,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790718492] [2021-11-07 01:16:02,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790718492] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:16:02,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:16:02,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-07 01:16:02,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159198103] [2021-11-07 01:16:02,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 01:16:02,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:16:02,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 01:16:02,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=30, Unknown=5, NotChecked=42, Total=110 [2021-11-07 01:16:02,073 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:16:04,470 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:16:06,537 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:16:08,610 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:16:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:16:11,870 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2021-11-07 01:16:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:16:11,872 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:16:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:16:11,873 INFO L225 Difference]: With dead ends: 84 [2021-11-07 01:16:11,873 INFO L226 Difference]: Without dead ends: 61 [2021-11-07 01:16:11,874 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:16:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-07 01:16:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 30. [2021-11-07 01:16:11,883 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:16:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-11-07 01:16:11,884 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 13 [2021-11-07 01:16:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:16:11,884 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-11-07 01:16:11,885 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:16:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-11-07 01:16:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:16:11,886 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:16:11,887 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:16:11,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:16:12,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:16:12,101 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:16:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:16:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 135134655, now seen corresponding path program 1 times [2021-11-07 01:16:12,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:16:12,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36873718] [2021-11-07 01:16:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:16:12,103 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:16:12,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:16:12,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:16:12,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 01:16:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:16:12,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:16:12,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:16:12,314 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:16:12,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:16:12,424 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:16:12,424 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:16:12,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36873718] [2021-11-07 01:16:12,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36873718] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:16:12,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:16:12,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 01:16:12,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037840572] [2021-11-07 01:16:12,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:16:12,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:16:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:16:12,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:16:12,428 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:16:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:16:12,463 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2021-11-07 01:16:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:16:12,464 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:16:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:16:12,465 INFO L225 Difference]: With dead ends: 49 [2021-11-07 01:16:12,465 INFO L226 Difference]: Without dead ends: 29 [2021-11-07 01:16:12,465 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:16:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-07 01:16:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-07 01:16:12,471 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:16:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-11-07 01:16:12,472 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2021-11-07 01:16:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:16:12,473 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-07 01:16:12,473 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:16:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-11-07 01:16:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:16:12,474 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:16:12,474 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:16:12,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:16:12,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:16:12,675 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:16:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:16:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2021-11-07 01:16:12,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:16:12,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874160665] [2021-11-07 01:16:12,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:16:12,677 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:16:12,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:16:12,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:16:12,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 01:16:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:16:12,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 01:16:12,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:16:12,889 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:16:12,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:16:13,025 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:16:13,025 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:16:13,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874160665] [2021-11-07 01:16:13,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874160665] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:16:13,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:16:13,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 01:16:13,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096560667] [2021-11-07 01:16:13,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:16:13,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:16:13,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:16:13,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:16:13,033 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:16:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:16:13,239 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2021-11-07 01:16:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:16:13,240 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:16:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:16:13,241 INFO L225 Difference]: With dead ends: 63 [2021-11-07 01:16:13,241 INFO L226 Difference]: Without dead ends: 61 [2021-11-07 01:16:13,241 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:16:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-07 01:16:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2021-11-07 01:16:13,254 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:16:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-11-07 01:16:13,258 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2021-11-07 01:16:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:16:13,259 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-11-07 01:16:13,259 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:16:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-11-07 01:16:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:16:13,263 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:16:13,263 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:16:13,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-07 01:16:13,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:16:13,486 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:16:13,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:16:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2021-11-07 01:16:13,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:16:13,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321421354] [2021-11-07 01:16:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:16:13,489 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:16:13,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:16:13,490 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:16:13,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-07 01:16:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:16:14,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 01:16:14,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:16:59,296 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))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) 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__E0~0 (fp.neg .cse0))))) is different from false [2021-11-07 01:17:01,305 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))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) 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__E0~0 (fp.neg .cse0))))) is different from true [2021-11-07 01:17:54,245 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:17:54,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:18:02,488 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:18:04,539 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:18:19,003 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:18:21,056 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:18:35,601 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:20:05,182 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:20:26,113 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:20:44,017 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:20:46,029 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:21:17,909 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:21:17,909 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:21:17,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321421354] [2021-11-07 01:21:17,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321421354] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:21:17,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:21:17,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-07 01:21:17,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410392601] [2021-11-07 01:21:17,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-07 01:21:17,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:21:17,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 01:21:17,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=82, Unknown=20, NotChecked=182, Total=342 [2021-11-07 01:21:17,912 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 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:22:04,383 WARN L207 SmtUtils]: Spent 10.10 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-07 01:22:46,927 WARN L207 SmtUtils]: Spent 9.66 s on a formula simplification that was a NOOP. DAG size: 28 [2021-11-07 01:23:02,689 WARN L207 SmtUtils]: Spent 5.04 s on a formula simplification that was a NOOP. DAG size: 28 [2021-11-07 01:23:09,538 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:23:14,131 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:23:20,055 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:23:22,793 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:24:06,198 WARN L207 SmtUtils]: Spent 5.19 s on a formula simplification that was a NOOP. DAG size: 28 [2021-11-07 01:24:26,557 WARN L207 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 28 [2021-11-07 01:24:58,655 WARN L207 SmtUtils]: Spent 7.97 s on a formula simplification that was a NOOP. DAG size: 33 [2021-11-07 01:25:10,913 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:25:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:25:21,509 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2021-11-07 01:25:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:25:21,510 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 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) Word has length 24 [2021-11-07 01:25:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:25:21,512 INFO L225 Difference]: With dead ends: 99 [2021-11-07 01:25:21,512 INFO L226 Difference]: Without dead ends: 80 [2021-11-07 01:25:21,513 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 211.0s TimeCoverageRelationStatistics Valid=129, Invalid=230, Unknown=69, NotChecked=564, Total=992 [2021-11-07 01:25:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-07 01:25:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2021-11-07 01:25:21,525 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:25:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2021-11-07 01:25:21,526 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 24 [2021-11-07 01:25:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:25:21,527 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2021-11-07 01:25:21,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 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:25:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2021-11-07 01:25:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:25:21,528 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:25:21,528 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:25:21,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-07 01:25:21,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:25:21,729 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:25:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:25:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2054568430, now seen corresponding path program 1 times [2021-11-07 01:25:21,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:25:21,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317618914] [2021-11-07 01:25:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:25:21,730 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:25:21,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:25:21,732 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:25:21,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b17465ee-0f26-4070-b9fc-fdd3340e4af4/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-07 01:25:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:25:23,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-07 01:25:23,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:26:08,879 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:27:39,854 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:27:41,884 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