java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_interval_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:49:56,946 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:49:56,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:49:56,967 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:49:56,967 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:49:56,969 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:49:56,970 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:49:56,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:49:56,974 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:49:56,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:49:56,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:49:56,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:49:56,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:49:56,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:49:56,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:49:56,980 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:49:56,981 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:49:56,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:49:56,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:49:56,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:49:56,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:49:56,989 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:49:56,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:49:56,992 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:49:56,992 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:49:56,993 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:49:56,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:49:56,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:49:56,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:49:56,998 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:49:56,998 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:49:56,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:49:56,999 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:49:57,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:49:57,001 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:49:57,002 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:49:57,002 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:49:57,018 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:49:57,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:49:57,019 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:49:57,020 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:49:57,020 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:49:57,020 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:49:57,021 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:49:57,021 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:49:57,021 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:49:57,021 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:49:57,021 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:49:57,022 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:49:57,022 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:49:57,022 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:49:57,022 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:49:57,022 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:49:57,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:49:57,023 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:49:57,023 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:49:57,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:49:57,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:49:57,024 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:49:57,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:49:57,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:49:57,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:49:57,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:49:57,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:49:57,025 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:49:57,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:49:57,025 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:49:57,026 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:49:57,026 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:49:57,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:49:57,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:49:57,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:49:57,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:49:57,092 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:49:57,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_interval_true-unreach-call.c [2018-09-19 15:49:57,482 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d289dcfd/6e6ffb6056a94b50b90de9101584fe8a/FLAGd75a1f7bd [2018-09-19 15:49:57,642 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:49:57,643 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Householder_interval_true-unreach-call.c [2018-09-19 15:49:57,651 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d289dcfd/6e6ffb6056a94b50b90de9101584fe8a/FLAGd75a1f7bd [2018-09-19 15:49:57,670 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d289dcfd/6e6ffb6056a94b50b90de9101584fe8a [2018-09-19 15:49:57,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:49:57,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:49:57,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:49:57,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:49:57,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:49:57,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:49:57" (1/1) ... [2018-09-19 15:49:57,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18420f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57, skipping insertion in model container [2018-09-19 15:49:57,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:49:57" (1/1) ... [2018-09-19 15:49:57,713 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:49:57,933 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:49:57,957 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:49:57,971 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:49:57,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57 WrapperNode [2018-09-19 15:49:57,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:49:57,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:49:57,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:49:57,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:49:58,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57" (1/1) ... [2018-09-19 15:49:58,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57" (1/1) ... [2018-09-19 15:49:58,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57" (1/1) ... [2018-09-19 15:49:58,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57" (1/1) ... [2018-09-19 15:49:58,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57" (1/1) ... [2018-09-19 15:49:58,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57" (1/1) ... [2018-09-19 15:49:58,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57" (1/1) ... [2018-09-19 15:49:58,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:49:58,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:49:58,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:49:58,058 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:49:58,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:49:58,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:49:58,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:49:58,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:49:58,125 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-09-19 15:49:58,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:49:58,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:49:58,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 15:49:58,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:49:58,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:49:58,126 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-09-19 15:49:58,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:49:58,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:49:58,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:50:07,493 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:50:07,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:50:07 BoogieIcfgContainer [2018-09-19 15:50:07,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:50:07,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:50:07,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:50:07,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:50:07,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:49:57" (1/3) ... [2018-09-19 15:50:07,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5d167f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:50:07, skipping insertion in model container [2018-09-19 15:50:07,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:49:57" (2/3) ... [2018-09-19 15:50:07,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5d167f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:50:07, skipping insertion in model container [2018-09-19 15:50:07,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:50:07" (3/3) ... [2018-09-19 15:50:07,514 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval_true-unreach-call.c [2018-09-19 15:50:07,525 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:50:07,535 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:50:07,585 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:50:07,586 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:50:07,586 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:50:07,586 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:50:07,586 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:50:07,586 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:50:07,588 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:50:07,588 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:50:07,588 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:50:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-09-19 15:50:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-19 15:50:07,623 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:07,624 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:50:07,626 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 469878416, now seen corresponding path program 1 times [2018-09-19 15:50:07,637 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:07,638 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:50:07,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:50:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:09,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:50:09,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:50:09,237 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:50:09,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:50:09,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:50:09,255 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:50:09,256 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:50:09,259 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-09-19 15:50:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:50:09,283 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-09-19 15:50:09,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:50:09,285 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-19 15:50:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:50:09,294 INFO L225 Difference]: With dead ends: 44 [2018-09-19 15:50:09,295 INFO L226 Difference]: Without dead ends: 21 [2018-09-19 15:50:09,299 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:50:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-19 15:50:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-19 15:50:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-19 15:50:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-19 15:50:09,341 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-09-19 15:50:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:50:09,341 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-19 15:50:09,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:50:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-19 15:50:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-19 15:50:09,343 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:09,343 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:50:09,343 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:09,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1576115003, now seen corresponding path program 1 times [2018-09-19 15:50:09,344 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:09,344 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:50:09,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:50:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:10,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:19,337 WARN L178 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-09-19 15:50:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:50:19,345 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:50:19,378 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:50:19,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 15:50:19,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 15:50:19,381 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 15:50:19,381 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:50:19,382 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-09-19 15:50:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:50:27,937 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-19 15:50:27,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 15:50:27,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-09-19 15:50:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:50:27,939 INFO L225 Difference]: With dead ends: 33 [2018-09-19 15:50:27,940 INFO L226 Difference]: Without dead ends: 24 [2018-09-19 15:50:27,941 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:50:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-19 15:50:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-19 15:50:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-19 15:50:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-09-19 15:50:27,948 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-09-19 15:50:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:50:27,948 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-09-19 15:50:27,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 15:50:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-09-19 15:50:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-19 15:50:27,949 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:27,950 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:50:27,950 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:27,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1317949565, now seen corresponding path program 1 times [2018-09-19 15:50:27,951 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:27,951 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:50:27,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:50:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:34,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:02,714 WARN L178 SmtUtils]: Spent 14.49 s on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 15:51:05,149 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp.div RNE .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (let ((.cse5 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (let ((.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse5)) (.cse4 (fp.mul RNE c_~_EPS~0 .cse5))) (let ((.cse2 (fp.lt .cse3 (fp.neg .cse4))) (.cse1 (fp.gt .cse3 .cse4))) (or (and (not .cse1) (not .cse2) (= (_ bv0 32) c_SqrtR_~cond~0)) (and (or .cse2 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)))))))) is different from false [2018-09-19 15:51:07,838 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp.div RNE .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (let ((.cse5 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (let ((.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse5)) (.cse4 (fp.mul RNE c_~_EPS~0 .cse5))) (let ((.cse2 (fp.lt .cse3 (fp.neg .cse4))) (.cse1 (fp.gt .cse3 .cse4))) (or (and (not .cse1) (not .cse2) (= (_ bv0 32) c_SqrtR_~cond~0)) (and (or .cse2 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)))))))) is different from true [2018-09-19 15:51:10,317 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (let ((.cse0 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse3)) (.cse1 (fp.mul RNE c_~_EPS~0 .cse3)) (.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.div RNE .cse2 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse2))))) is different from false [2018-09-19 15:51:12,437 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (let ((.cse0 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse3)) (.cse1 (fp.mul RNE c_~_EPS~0 .cse3)) (.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.div RNE .cse2 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse2))))) is different from true [2018-09-19 15:51:15,354 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE .cse2 |c_SqrtR_#in~Input|))) (let ((.cse4 (fp.add RNE .cse3 .cse3))) (let ((.cse0 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse4)) (.cse1 (fp.mul RNE c_~_EPS~0 .cse4))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.div RNE .cse2 .cse3) |c_SqrtR_#res|) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse2)) (not (fp.gt .cse0 .cse1))))))) is different from false [2018-09-19 15:51:17,850 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE .cse2 |c_SqrtR_#in~Input|))) (let ((.cse4 (fp.add RNE .cse3 .cse3))) (let ((.cse0 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse4)) (.cse1 (fp.mul RNE c_~_EPS~0 .cse4))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.div RNE .cse2 .cse3) |c_SqrtR_#res|) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse2)) (not (fp.gt .cse0 .cse1))))))) is different from true [2018-09-19 15:51:20,730 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~d~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5)) (.cse3 (fp.mul RNE .cse4 .cse5))) (and (fp.leq main_~d~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq main_~d~0 .cse0)) (= |c_main_#t~ret2| (fp.div RNE .cse0 .cse1)) (fp.geq main_~d~0 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)))))))) is different from false [2018-09-19 15:51:23,453 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~d~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5)) (.cse3 (fp.mul RNE .cse4 .cse5))) (and (fp.leq main_~d~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq main_~d~0 .cse0)) (= |c_main_#t~ret2| (fp.div RNE .cse0 .cse1)) (fp.geq main_~d~0 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)))))))) is different from true [2018-09-19 15:51:26,302 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~d~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5)) (.cse3 (fp.mul RNE .cse4 .cse5))) (and (fp.leq main_~d~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq main_~d~0 .cse0)) (fp.geq main_~d~0 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (= (fp.div RNE .cse0 .cse1) c_main_~r~0) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)))))))) is different from false [2018-09-19 15:51:29,001 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~d~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5)) (.cse3 (fp.mul RNE .cse4 .cse5))) (and (fp.leq main_~d~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq main_~d~0 .cse0)) (fp.geq main_~d~0 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (= (fp.div RNE .cse0 .cse1) c_main_~r~0) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)))))))) is different from true [2018-09-19 15:51:52,611 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse4 (fp.div RNE .cse3 v_prenex_5))) (let ((.cse5 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse6 (fp.add RNE .cse4 .cse4))) (let ((.cse1 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse5) .cse6)) (.cse2 (fp.mul RNE .cse5 .cse6)) (.cse0 (fp.div RNE .cse3 .cse4))) (and (fp.geq .cse0 ((_ to_fp 11 53) RNE (/ 3.0 10.0))) (fp.geq v_prenex_5 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.gt .cse1 .cse2)) (fp.leq .cse0 ((_ to_fp 11 53) RNE 5.0)) (not (fp.leq v_prenex_5 .cse3)) (fp.leq v_prenex_5 ((_ to_fp 11 53) RNE 20.0))))))))) (and (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse8 (fp.div RNE .cse7 main_~d~0))) (let ((.cse11 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse12 (fp.add RNE .cse8 .cse8))) (let ((.cse9 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse11) .cse12)) (.cse10 (fp.mul RNE .cse11 .cse12))) (and (not (fp.leq (fp.div RNE .cse7 .cse8) ((_ to_fp 11 53) RNE 5.0))) (fp.leq main_~d~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq main_~d~0 .cse7)) (fp.geq main_~d~0 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.lt .cse9 (fp.neg .cse10))) (not (fp.gt .cse9 .cse10)))))))) .cse13) (and (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse17 (fp.div RNE .cse14 v_prenex_3))) (let ((.cse18 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse19 (fp.add RNE .cse17 .cse17))) (let ((.cse15 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse18) .cse19)) (.cse16 (fp.mul RNE .cse18 .cse19))) (and (not (fp.leq v_prenex_3 .cse14)) (not (fp.lt .cse15 (fp.neg .cse16))) (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 20.0)) (fp.geq v_prenex_3 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.gt .cse15 .cse16)) (not (fp.geq (fp.div RNE .cse14 .cse17) ((_ to_fp 11 53) RNE (/ 3.0 10.0)))))))))) .cse13))) is different from false [2018-09-19 15:52:13,206 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse1 main_~d~0))) (let ((.cse5 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse6 (fp.add RNE .cse2 .cse2))) (let ((.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse5) .cse6)) (.cse4 (fp.mul RNE .cse5 .cse6))) (and (not (fp.leq (fp.div RNE .cse1 .cse2) ((_ to_fp 11 53) RNE 5.0))) (fp.leq main_~d~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq main_~d~0 .cse1)) (fp.geq main_~d~0 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.lt .cse3 (fp.neg .cse4))) (not (fp.gt .cse3 .cse4))))))))) (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse11 (fp.div RNE .cse10 v_prenex_5))) (let ((.cse12 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse13 (fp.add RNE .cse11 .cse11))) (let ((.cse8 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse12) .cse13)) (.cse9 (fp.mul RNE .cse12 .cse13)) (.cse7 (fp.div RNE .cse10 .cse11))) (and (fp.geq .cse7 ((_ to_fp 11 53) RNE (/ 3.0 10.0))) (fp.geq v_prenex_5 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.lt .cse8 (fp.neg .cse9))) (not (fp.gt .cse8 .cse9)) (fp.leq .cse7 ((_ to_fp 11 53) RNE 5.0)) (not (fp.leq v_prenex_5 .cse10)) (fp.leq v_prenex_5 ((_ to_fp 11 53) RNE 20.0))))))))) (and .cse0 (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse17 (fp.div RNE .cse14 v_prenex_3))) (let ((.cse18 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse19 (fp.add RNE .cse17 .cse17))) (let ((.cse15 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse18) .cse19)) (.cse16 (fp.mul RNE .cse18 .cse19))) (and (not (fp.leq v_prenex_3 .cse14)) (not (fp.lt .cse15 (fp.neg .cse16))) (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 20.0)) (fp.geq v_prenex_3 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.gt .cse15 .cse16)) (not (fp.geq (fp.div RNE .cse14 .cse17) ((_ to_fp 11 53) RNE (/ 3.0 10.0))))))))))))) is different from false [2018-09-19 15:52:28,047 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~d~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5)) (.cse3 (fp.mul RNE .cse4 .cse5))) (and (not (fp.leq (fp.div RNE .cse0 .cse1) ((_ to_fp 11 53) RNE 5.0))) (fp.leq main_~d~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq main_~d~0 .cse0)) (fp.geq main_~d~0 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)))))))) (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse9 (fp.div RNE .cse6 v_prenex_3))) (let ((.cse10 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse11 (fp.add RNE .cse9 .cse9))) (let ((.cse7 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse10) .cse11)) (.cse8 (fp.mul RNE .cse10 .cse11))) (and (not (fp.leq v_prenex_3 .cse6)) (not (fp.lt .cse7 (fp.neg .cse8))) (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 20.0)) (fp.geq v_prenex_3 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.gt .cse7 .cse8)) (not (fp.geq (fp.div RNE .cse6 .cse9) ((_ to_fp 11 53) RNE (/ 3.0 10.0))))))))))) is different from false [2018-09-19 15:52:30,775 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~d~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5)) (.cse3 (fp.mul RNE .cse4 .cse5))) (and (not (fp.leq (fp.div RNE .cse0 .cse1) ((_ to_fp 11 53) RNE 5.0))) (fp.leq main_~d~0 ((_ to_fp 11 53) RNE 20.0)) (not (fp.leq main_~d~0 .cse0)) (fp.geq main_~d~0 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.lt .cse2 (fp.neg .cse3))) (not (fp.gt .cse2 .cse3)))))))) (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse9 (fp.div RNE .cse6 v_prenex_3))) (let ((.cse10 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse11 (fp.add RNE .cse9 .cse9))) (let ((.cse7 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse10) .cse11)) (.cse8 (fp.mul RNE .cse10 .cse11))) (and (not (fp.leq v_prenex_3 .cse6)) (not (fp.lt .cse7 (fp.neg .cse8))) (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 20.0)) (fp.geq v_prenex_3 ((_ to_fp 11 53) RNE (/ 1.0 10.0))) (not (fp.gt .cse7 .cse8)) (not (fp.geq (fp.div RNE .cse6 .cse9) ((_ to_fp 11 53) RNE (/ 3.0 10.0))))))))))) is different from true [2018-09-19 15:52:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:52:30,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:52:30,840 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:52:30,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 15:52:30,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 15:52:30,842 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 15:52:30,844 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=16, Unknown=18, NotChecked=120, Total=182 [2018-09-19 15:52:30,845 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 14 states. [2018-09-19 15:52:45,728 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-09-19 15:52:45,730 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:690) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:603) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-09-19 15:52:45,734 INFO L168 Benchmark]: Toolchain (without parser) took 168050.21 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -657.0 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-09-19 15:52:45,735 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:52:45,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:52:45,737 INFO L168 Benchmark]: Boogie Preprocessor took 65.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:52:45,738 INFO L168 Benchmark]: RCFGBuilder took 9435.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.2 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2018-09-19 15:52:45,739 INFO L168 Benchmark]: TraceAbstraction took 158233.15 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. [2018-09-19 15:52:45,744 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 9435.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.2 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 158233.15 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...