./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs --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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:36:04,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:36:04,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:36:04,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:36:04,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:36:04,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:36:04,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:36:04,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:36:04,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:36:04,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:36:04,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:36:04,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:36:04,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:36:04,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:36:04,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:36:04,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:36:04,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:36:04,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:36:04,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:36:04,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:36:04,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:36:04,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:36:04,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:36:04,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:36:04,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:36:04,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:36:04,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:36:04,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:36:04,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:36:04,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:36:04,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:36:04,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:36:04,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:36:04,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:36:04,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:36:04,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:36:04,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:36:04,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:36:04,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:36:04,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:36:04,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:36:04,739 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 14:36:04,791 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:36:04,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:36:04,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:36:04,793 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:36:04,793 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:36:04,794 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:36:04,794 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:36:04,794 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 14:36:04,801 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:36:04,802 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:36:04,803 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 14:36:04,803 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 14:36:04,803 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:36:04,803 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 14:36:04,804 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 14:36:04,804 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 14:36:04,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:36:04,805 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:36:04,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 14:36:04,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:36:04,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:36:04,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:36:04,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:36:04,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:36:04,807 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:36:04,807 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:36:04,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:36:04,807 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:36:04,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:36:04,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:36:04,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:36:04,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:36:04,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:36:04,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:36:04,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:36:04,811 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 14:36:04,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 14:36:04,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:36:04,811 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:36:04,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:36:04,812 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_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/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_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-11-19 14:36:05,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:36:05,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:36:05,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:36:05,196 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:36:05,201 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:36:05,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-19 14:36:05,307 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data/bbe6eaf60/2e93869516504b17a62e41614e7cf29c/FLAG113148cf7 [2021-11-19 14:36:05,836 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:36:05,836 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-19 14:36:05,843 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data/bbe6eaf60/2e93869516504b17a62e41614e7cf29c/FLAG113148cf7 [2021-11-19 14:36:06,176 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data/bbe6eaf60/2e93869516504b17a62e41614e7cf29c [2021-11-19 14:36:06,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:36:06,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:36:06,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:36:06,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:36:06,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:36:06,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc21285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06, skipping insertion in model container [2021-11-19 14:36:06,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:36:06,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:36:06,406 WARN L230 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_f65dad56-9576-48e9-9a69-239f5e9cac81/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-19 14:36:06,429 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:36:06,442 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:36:06,456 WARN L230 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_f65dad56-9576-48e9-9a69-239f5e9cac81/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-19 14:36:06,461 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:36:06,474 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:36:06,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06 WrapperNode [2021-11-19 14:36:06,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:36:06,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:36:06,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:36:06,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:36:06,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,516 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2021-11-19 14:36:06,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:36:06,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:36:06,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:36:06,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:36:06,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:36:06,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:36:06,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:36:06,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:36:06,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (1/1) ... [2021-11-19 14:36:06,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:36:06,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:36:06,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:36:06,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:36:06,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:36:06,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 14:36:06,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:36:06,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:36:06,717 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:36:06,719 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:36:06,812 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:36:06,869 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:36:06,869 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 14:36:06,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:36:06 BoogieIcfgContainer [2021-11-19 14:36:06,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:36:06,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:36:06,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:36:06,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:36:06,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:36:06" (1/3) ... [2021-11-19 14:36:06,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1b6c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:36:06, skipping insertion in model container [2021-11-19 14:36:06,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:06" (2/3) ... [2021-11-19 14:36:06,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1b6c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:36:06, skipping insertion in model container [2021-11-19 14:36:06,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:36:06" (3/3) ... [2021-11-19 14:36:06,903 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-11-19 14:36:06,910 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:36:06,910 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:36:07,016 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:36:07,025 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-19 14:36:07,025 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:36:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-19 14:36:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-19 14:36:07,051 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:36:07,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-19 14:36:07,052 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:36:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:36:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash 67880, now seen corresponding path program 1 times [2021-11-19 14:36:07,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:36:07,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767136315] [2021-11-19 14:36:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:36:07,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:36:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:36:07,269 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 14:36:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 14:36:07,343 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-19 14:36:07,347 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 14:36:07,349 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 14:36:07,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 14:36:07,358 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-11-19 14:36:07,362 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 14:36:07,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 02:36:07 BoogieIcfgContainer [2021-11-19 14:36:07,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 14:36:07,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 14:36:07,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 14:36:07,388 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 14:36:07,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:36:06" (3/4) ... [2021-11-19 14:36:07,393 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 14:36:07,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 14:36:07,395 INFO L158 Benchmark]: Toolchain (without parser) took 1214.30ms. Allocated memory is still 98.6MB. Free memory was 57.1MB in the beginning and 47.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2021-11-19 14:36:07,396 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 98.6MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:36:07,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.72ms. Allocated memory is still 98.6MB. Free memory was 56.8MB in the beginning and 73.2MB in the end (delta: -16.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-19 14:36:07,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.69ms. Allocated memory is still 98.6MB. Free memory was 73.2MB in the beginning and 71.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:36:07,399 INFO L158 Benchmark]: Boogie Preprocessor took 23.25ms. Allocated memory is still 98.6MB. Free memory was 71.7MB in the beginning and 70.8MB in the end (delta: 828.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:36:07,412 INFO L158 Benchmark]: RCFGBuilder took 335.24ms. Allocated memory is still 98.6MB. Free memory was 70.8MB in the beginning and 60.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-19 14:36:07,413 INFO L158 Benchmark]: TraceAbstraction took 508.31ms. Allocated memory is still 98.6MB. Free memory was 60.0MB in the beginning and 47.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-19 14:36:07,414 INFO L158 Benchmark]: Witness Printer took 5.60ms. Allocated memory is still 98.6MB. Free memory was 47.4MB in the beginning and 47.2MB in the end (delta: 265.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:36:07,418 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.36ms. Allocated memory is still 98.6MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.72ms. Allocated memory is still 98.6MB. Free memory was 56.8MB in the beginning and 73.2MB in the end (delta: -16.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.69ms. Allocated memory is still 98.6MB. Free memory was 73.2MB in the beginning and 71.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.25ms. Allocated memory is still 98.6MB. Free memory was 71.7MB in the beginning and 70.8MB in the end (delta: 828.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 335.24ms. Allocated memory is still 98.6MB. Free memory was 70.8MB in the beginning and 60.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 508.31ms. Allocated memory is still 98.6MB. Free memory was 60.0MB in the beginning and 47.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 5.60ms. Allocated memory is still 98.6MB. Free memory was 47.4MB in the beginning and 47.2MB in the end (delta: 265.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: 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 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L25] CALL assume_abort_if_not(I >= 1. && I <= 3.) [L14] COND FALSE !(!cond) [L25] RET assume_abort_if_not(I >= 1. && I <= 3.) [L27] COND FALSE !(I >= 2.) [L28] S = 1.+(I-1.) * (.5+(I-1.) * (-.125+(I-1.)*.0625)) [L30] CALL __VERIFIER_assert(S >= 1. && S <= 2.) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] [L16] reach_error() VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-19 14:36:07,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/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_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs --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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:36:10,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:36:10,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:36:10,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:36:10,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:36:10,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:36:10,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:36:10,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:36:10,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:36:10,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:36:10,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:36:10,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:36:10,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:36:10,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:36:10,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:36:10,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:36:10,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:36:10,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:36:10,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:36:10,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:36:10,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:36:10,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:36:10,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:36:10,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:36:10,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:36:10,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:36:10,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:36:10,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:36:10,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:36:10,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:36:10,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:36:10,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:36:10,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:36:10,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:36:10,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:36:10,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:36:10,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:36:10,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:36:10,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:36:10,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:36:10,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:36:10,328 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 14:36:10,365 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:36:10,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:36:10,366 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:36:10,367 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:36:10,367 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:36:10,368 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:36:10,368 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:36:10,368 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:36:10,369 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:36:10,369 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:36:10,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:36:10,371 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:36:10,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:36:10,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:36:10,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:36:10,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:36:10,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:36:10,373 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:36:10,373 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 14:36:10,373 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 14:36:10,374 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:36:10,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:36:10,374 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:36:10,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:36:10,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:36:10,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 14:36:10,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:36:10,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:36:10,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:36:10,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:36:10,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:36:10,377 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 14:36:10,378 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 14:36:10,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:36:10,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:36:10,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:36:10,379 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_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/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_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-11-19 14:36:10,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:36:10,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:36:10,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:36:10,913 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:36:10,914 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:36:10,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-19 14:36:11,001 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data/09d735214/80c84cafd82b4de2a92ad6f59e69b66f/FLAG6ef7e5bc1 [2021-11-19 14:36:11,638 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:36:11,638 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-19 14:36:11,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data/09d735214/80c84cafd82b4de2a92ad6f59e69b66f/FLAG6ef7e5bc1 [2021-11-19 14:36:12,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/data/09d735214/80c84cafd82b4de2a92ad6f59e69b66f [2021-11-19 14:36:12,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:36:12,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:36:12,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:36:12,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:36:12,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:36:12,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a6562b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12, skipping insertion in model container [2021-11-19 14:36:12,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:36:12,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:36:12,288 WARN L230 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_f65dad56-9576-48e9-9a69-239f5e9cac81/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-19 14:36:12,314 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:36:12,345 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:36:12,366 WARN L230 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_f65dad56-9576-48e9-9a69-239f5e9cac81/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-19 14:36:12,387 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:36:12,410 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:36:12,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12 WrapperNode [2021-11-19 14:36:12,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:36:12,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:36:12,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:36:12,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:36:12,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,522 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2021-11-19 14:36:12,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:36:12,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:36:12,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:36:12,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:36:12,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:36:12,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:36:12,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:36:12,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:36:12,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (1/1) ... [2021-11-19 14:36:12,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:36:12,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:36:12,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:36:12,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:36:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 14:36:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 14:36:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:36:12,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:36:12,739 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:36:12,740 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:36:17,169 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:36:17,176 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:36:17,177 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 14:36:17,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:36:17 BoogieIcfgContainer [2021-11-19 14:36:17,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:36:17,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:36:17,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:36:17,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:36:17,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:36:12" (1/3) ... [2021-11-19 14:36:17,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3224f7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:36:17, skipping insertion in model container [2021-11-19 14:36:17,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:36:12" (2/3) ... [2021-11-19 14:36:17,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3224f7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:36:17, skipping insertion in model container [2021-11-19 14:36:17,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:36:17" (3/3) ... [2021-11-19 14:36:17,193 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-11-19 14:36:17,198 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:36:17,198 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 14:36:17,268 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:36:17,276 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-19 14:36:17,276 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 14:36:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-19 14:36:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 14:36:17,292 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:36:17,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:36:17,293 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:36:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:36:17,300 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2021-11-19 14:36:17,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:36:17,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850832588] [2021-11-19 14:36:17,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:36:17,315 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:36:17,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:36:17,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:36:17,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 14:36:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:36:18,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-19 14:36:18,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:36:18,751 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-19 14:36:18,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:36:18,820 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-19 14:36:18,821 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:36:18,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850832588] [2021-11-19 14:36:18,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850832588] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:36:18,823 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:36:18,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-19 14:36:18,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782184547] [2021-11-19 14:36:18,826 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:36:18,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 14:36:18,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:36:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 14:36:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:36:18,867 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:36:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:36:18,883 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-11-19 14:36:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 14:36:18,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-19 14:36:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:36:18,895 INFO L225 Difference]: With dead ends: 23 [2021-11-19 14:36:18,895 INFO L226 Difference]: Without dead ends: 9 [2021-11-19 14:36:18,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 14:36:18,903 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:36:18,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 14:36:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-19 14:36:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-19 14:36:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-19 14:36:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-11-19 14:36:18,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2021-11-19 14:36:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:36:18,942 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-11-19 14:36:18,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:36:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-11-19 14:36:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 14:36:18,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:36:18,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:36:18,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-19 14:36:19,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:36:19,160 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:36:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:36:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2021-11-19 14:36:19,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:36:19,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395504104] [2021-11-19 14:36:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:36:19,162 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:36:19,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:36:19,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:36:19,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 14:36:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:36:20,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 14:36:20,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:36:37,517 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1))))))) |c_ULTIMATE.start_main_~S~0#1|) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 14:38:24,820 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse2 (fp.leq .cse3 .cse0)) (.cse1 (fp.geq .cse3 .cse4))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1)))))))))) is different from false [2021-11-19 14:38:26,902 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse2 (fp.leq .cse3 .cse0)) (.cse1 (fp.geq .cse3 .cse4))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1)))))))))) is different from true [2021-11-19 14:39:19,242 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))))))) is different from false [2021-11-19 14:39:21,320 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))))))) is different from true [2021-11-19 14:39:21,321 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-19 14:39:21,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:39:37,479 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from false [2021-11-19 14:39:39,657 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from true [2021-11-19 14:40:13,582 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from false [2021-11-19 14:40:15,761 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from true [2021-11-19 14:41:11,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) is different from false [2021-11-19 14:41:13,568 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) is different from true [2021-11-19 14:41:13,569 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-19 14:41:13,570 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:41:13,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395504104] [2021-11-19 14:41:13,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395504104] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:41:13,570 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:41:13,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-19 14:41:13,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340973883] [2021-11-19 14:41:13,571 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:41:13,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:41:13,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:41:13,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:41:13,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-11-19 14:41:13,575 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-19 14:41:15,732 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 14:41:17,890 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 14:41:20,016 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse3)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-19 14:41:22,189 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse3)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 14:41:24,316 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2021-11-19 14:41:26,502 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2021-11-19 14:41:28,635 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1))))))) |c_ULTIMATE.start_main_~S~0#1|) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (fp.geq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 14:41:30,778 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse2 (fp.leq .cse3 .cse0)) (.cse1 (fp.geq .cse3 .cse4))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1))))))))))) is different from false [2021-11-19 14:41:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:41:30,799 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2021-11-19 14:41:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 14:41:30,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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 8 [2021-11-19 14:41:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:41:30,801 INFO L225 Difference]: With dead ends: 13 [2021-11-19 14:41:30,801 INFO L226 Difference]: Without dead ends: 9 [2021-11-19 14:41:30,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-11-19 14:41:30,805 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:41:30,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2021-11-19 14:41:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-19 14:41:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-19 14:41:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:41:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2021-11-19 14:41:30,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 8 [2021-11-19 14:41:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:41:30,811 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2021-11-19 14:41:30,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-19 14:41:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2021-11-19 14:41:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 14:41:30,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:41:30,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:41:30,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-19 14:41:31,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:41:31,032 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 14:41:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:41:31,034 INFO L85 PathProgramCache]: Analyzing trace with hash 176701705, now seen corresponding path program 1 times [2021-11-19 14:41:31,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 14:41:31,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71171550] [2021-11-19 14:41:31,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:41:31,035 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 14:41:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 14:41:31,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 14:41:31,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 14:42:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:42:13,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-19 14:42:13,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:42:30,546 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) |c_ULTIMATE.start_main_~S~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 14:44:18,706 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven .cse0 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse4)) (.cse2 (fp.geq .cse3 .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse1) (not .cse2))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4))))) is different from false [2021-11-19 14:44:20,804 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven .cse0 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse4)) (.cse2 (fp.geq .cse3 .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse1) (not .cse2))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4))))) is different from true [2021-11-19 14:45:14,073 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse0)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2))))) is different from false [2021-11-19 14:45:16,167 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse0)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2))))) is different from true [2021-11-19 14:45:16,173 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-19 14:45:16,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:45:32,105 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from false [2021-11-19 14:45:34,249 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from true [2021-11-19 14:46:07,913 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from false [2021-11-19 14:46:10,064 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from true [2021-11-19 14:47:04,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) is different from false [2021-11-19 14:47:06,452 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) is different from true [2021-11-19 14:47:06,452 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-19 14:47:06,453 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 14:47:06,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71171550] [2021-11-19 14:47:06,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71171550] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:47:06,453 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:47:06,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-19 14:47:06,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414583334] [2021-11-19 14:47:06,454 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:47:06,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:47:06,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 14:47:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:47:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-11-19 14:47:06,456 INFO L87 Difference]: Start difference. First operand 9 states and 8 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-19 14:47:08,578 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 14:47:10,727 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-19 14:47:12,868 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) .cse4 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-19 14:47:15,008 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) .cse4 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-19 14:47:17,172 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2021-11-19 14:47:19,322 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2021-11-19 14:47:21,477 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) |c_ULTIMATE.start_main_~S~0#1|)))) (fp.geq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-19 14:47:23,641 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven .cse0 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse4)) (.cse2 (fp.geq .cse3 .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse1) (not .cse2))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4)))))) is different from false [2021-11-19 14:47:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:47:23,654 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2021-11-19 14:47:23,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 14:47:23,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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 8 [2021-11-19 14:47:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:47:23,655 INFO L225 Difference]: With dead ends: 9 [2021-11-19 14:47:23,655 INFO L226 Difference]: Without dead ends: 0 [2021-11-19 14:47:23,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-11-19 14:47:23,657 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:47:23,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2021-11-19 14:47:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-19 14:47:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-19 14:47:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:47:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-19 14:47:23,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2021-11-19 14:47:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:47:23,661 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-19 14:47:23,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-19 14:47:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-19 14:47:23,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-19 14:47:23,664 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 14:47:23,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-19 14:47:23,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 14:47:23,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-19 14:47:23,877 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-19 14:47:23,877 INFO L861 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2021-11-19 14:47:23,878 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 28) no Hoare annotation was computed. [2021-11-19 14:47:23,878 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 28) no Hoare annotation was computed. [2021-11-19 14:47:23,878 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 15) no Hoare annotation was computed. [2021-11-19 14:47:23,878 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-19 14:47:23,878 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-19 14:47:23,879 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-19 14:47:23,879 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-11-19 14:47:23,879 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-11-19 14:47:23,879 INFO L858 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-11-19 14:47:23,880 INFO L858 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-11-19 14:47:23,880 INFO L861 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2021-11-19 14:47:23,884 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-19 14:47:23,886 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 14:47:23,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 02:47:23 BoogieIcfgContainer [2021-11-19 14:47:23,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 14:47:23,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 14:47:23,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 14:47:23,911 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 14:47:23,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:36:17" (3/4) ... [2021-11-19 14:47:23,916 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-19 14:47:23,929 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2021-11-19 14:47:23,934 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-19 14:47:23,936 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-19 14:47:23,936 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-19 14:47:23,986 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/witness.graphml [2021-11-19 14:47:23,986 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 14:47:23,997 INFO L158 Benchmark]: Toolchain (without parser) took 671983.64ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 53.4MB in the beginning and 61.7MB in the end (delta: -8.3MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2021-11-19 14:47:23,998 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 71.3MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 50.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:47:23,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.52ms. Allocated memory is still 71.3MB. Free memory was 53.3MB in the beginning and 42.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-19 14:47:24,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.22ms. Allocated memory is still 71.3MB. Free memory was 42.7MB in the beginning and 53.8MB in the end (delta: -11.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:47:24,003 INFO L158 Benchmark]: Boogie Preprocessor took 29.00ms. Allocated memory is still 71.3MB. Free memory was 53.8MB in the beginning and 52.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:47:24,003 INFO L158 Benchmark]: RCFGBuilder took 4625.95ms. Allocated memory is still 71.3MB. Free memory was 52.5MB in the beginning and 44.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 14:47:24,004 INFO L158 Benchmark]: TraceAbstraction took 666728.79ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 43.6MB in the beginning and 63.8MB in the end (delta: -20.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 14:47:24,004 INFO L158 Benchmark]: Witness Printer took 84.83ms. Allocated memory is still 86.0MB. Free memory was 63.8MB in the beginning and 61.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 14:47:24,007 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.28ms. Allocated memory is still 71.3MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 50.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.52ms. Allocated memory is still 71.3MB. Free memory was 53.3MB in the beginning and 42.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.22ms. Allocated memory is still 71.3MB. Free memory was 42.7MB in the beginning and 53.8MB in the end (delta: -11.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.00ms. Allocated memory is still 71.3MB. Free memory was 53.8MB in the beginning and 52.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 4625.95ms. Allocated memory is still 71.3MB. Free memory was 52.5MB in the beginning and 44.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 666728.79ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 43.6MB in the beginning and 63.8MB in the end (delta: -20.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 84.83ms. Allocated memory is still 86.0MB. Free memory was 63.8MB in the beginning and 61.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 666.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 45.4s SatisfiabilityAnalysisTime, 585.8s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 8 QuantifiedInterpolants, 1799 SizeOfPredicates, 15 NumberOfNonLiveVariables, 78 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-19 14:47:24,239 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-19 14:47:24,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f65dad56-9576-48e9-9a69-239f5e9cac81/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE