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/zonotope_2_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:51:10,191 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:51:10,193 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:51:10,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:51:10,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:51:10,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:51:10,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:51:10,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:51:10,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:51:10,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:51:10,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:51:10,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:51:10,215 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:51:10,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:51:10,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:51:10,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:51:10,220 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:51:10,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:51:10,224 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:51:10,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:51:10,227 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:51:10,228 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:51:10,231 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:51:10,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:51:10,232 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:51:10,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:51:10,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:51:10,235 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:51:10,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:51:10,237 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:51:10,237 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:51:10,238 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:51:10,238 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:51:10,239 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:51:10,240 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:51:10,241 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:51:10,241 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:51:10,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:51:10,258 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:51:10,259 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:51:10,259 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:51:10,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:51:10,260 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:51:10,260 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:51:10,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:51:10,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:51:10,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:51:10,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:51:10,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:51:10,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:51:10,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:51:10,262 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:51:10,262 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:51:10,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:51:10,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:51:10,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:51:10,263 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:51:10,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:51:10,263 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:51:10,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:51:10,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:51:10,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:51:10,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:51:10,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:51:10,264 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:51:10,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:51:10,265 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:51:10,265 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:51:10,265 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:51:10,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:51:10,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:51:10,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:51:10,348 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:51:10,349 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:51:10,350 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_2_true-unreach-call_true-termination.c [2018-09-19 15:51:10,741 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a624c1c32/da655ee62d71411eb283b30bb4a1318a/FLAGe7c306855 [2018-09-19 15:51:10,909 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:51:10,909 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_2_true-unreach-call_true-termination.c [2018-09-19 15:51:10,916 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a624c1c32/da655ee62d71411eb283b30bb4a1318a/FLAGe7c306855 [2018-09-19 15:51:10,933 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a624c1c32/da655ee62d71411eb283b30bb4a1318a [2018-09-19 15:51:10,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:51:10,946 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:51:10,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:51:10,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:51:10,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:51:10,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:51:10" (1/1) ... [2018-09-19 15:51:10,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb5d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:10, skipping insertion in model container [2018-09-19 15:51:10,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:51:10" (1/1) ... [2018-09-19 15:51:10,975 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:51:11,218 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:51:11,242 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:51:11,256 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:51:11,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11 WrapperNode [2018-09-19 15:51:11,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:51:11,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:51:11,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:51:11,277 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:51:11,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11" (1/1) ... [2018-09-19 15:51:11,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11" (1/1) ... [2018-09-19 15:51:11,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11" (1/1) ... [2018-09-19 15:51:11,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11" (1/1) ... [2018-09-19 15:51:11,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11" (1/1) ... [2018-09-19 15:51:11,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11" (1/1) ... [2018-09-19 15:51:11,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11" (1/1) ... [2018-09-19 15:51:11,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:51:11,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:51:11,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:51:11,328 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:51:11,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11" (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:51:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:51:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:51:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:51:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:51:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:51:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:51:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:51:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:51:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:51:13,894 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:51:13,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:51:13 BoogieIcfgContainer [2018-09-19 15:51:13,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:51:13,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:51:13,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:51:13,900 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:51:13,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:51:10" (1/3) ... [2018-09-19 15:51:13,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162a046c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:51:13, skipping insertion in model container [2018-09-19 15:51:13,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:11" (2/3) ... [2018-09-19 15:51:13,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162a046c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:51:13, skipping insertion in model container [2018-09-19 15:51:13,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:51:13" (3/3) ... [2018-09-19 15:51:13,904 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2_true-unreach-call_true-termination.c [2018-09-19 15:51:13,915 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:51:13,937 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:51:13,991 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:51:13,992 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:51:13,993 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:51:13,993 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:51:13,993 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:51:13,993 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:51:13,995 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:51:13,995 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:51:13,995 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:51:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-19 15:51:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-19 15:51:14,019 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:14,021 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:14,023 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1137906749, now seen corresponding path program 1 times [2018-09-19 15:51:14,034 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:14,035 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:51:14,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:51:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:51:14,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:14,141 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:51:14,142 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:51:14,164 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:51:14,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:51:14,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:51:14,198 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:51:14,207 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:51:14,216 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-09-19 15:51:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:51:14,271 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-09-19 15:51:14,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:51:14,273 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-19 15:51:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:51:14,285 INFO L225 Difference]: With dead ends: 39 [2018-09-19 15:51:14,285 INFO L226 Difference]: Without dead ends: 17 [2018-09-19 15:51:14,289 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:51:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-19 15:51:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-19 15:51:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-19 15:51:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-09-19 15:51:14,335 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-09-19 15:51:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:51:14,335 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-09-19 15:51:14,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:51:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-09-19 15:51:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-19 15:51:14,337 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:14,338 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:14,338 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash 571460631, now seen corresponding path program 1 times [2018-09-19 15:51:14,339 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:14,339 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) [2018-09-19 15:51:14,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:51:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:51:14,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:14,436 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:51:14,437 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:51:14,447 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:51:14,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:51:14,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:51:14,450 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:51:14,451 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:51:14,451 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2018-09-19 15:51:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:51:16,671 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-09-19 15:51:16,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:51:16,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-19 15:51:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:51:16,673 INFO L225 Difference]: With dead ends: 26 [2018-09-19 15:51:16,673 INFO L226 Difference]: Without dead ends: 19 [2018-09-19 15:51:16,674 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:51:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-19 15:51:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-19 15:51:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-19 15:51:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-09-19 15:51:16,681 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2018-09-19 15:51:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:51:16,681 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-09-19 15:51:16,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:51:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-09-19 15:51:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-19 15:51:16,682 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:16,682 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:16,682 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash 573188509, now seen corresponding path program 1 times [2018-09-19 15:51:16,683 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:16,683 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) [2018-09-19 15:51:16,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:51:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:51:16,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:17,075 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:51:17,076 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:51:17,088 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:51:17,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 15:51:17,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 15:51:17,089 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 15:51:17,089 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-19 15:51:17,089 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 6 states. [2018-09-19 15:51:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:51:21,644 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-09-19 15:51:21,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 15:51:21,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-09-19 15:51:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:51:21,646 INFO L225 Difference]: With dead ends: 31 [2018-09-19 15:51:21,646 INFO L226 Difference]: Without dead ends: 29 [2018-09-19 15:51:21,646 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-19 15:51:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-19 15:51:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-09-19 15:51:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-19 15:51:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-09-19 15:51:21,657 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2018-09-19 15:51:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:51:21,658 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-09-19 15:51:21,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 15:51:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-09-19 15:51:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-19 15:51:21,659 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:21,659 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:21,660 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1107402564, now seen corresponding path program 1 times [2018-09-19 15:51:21,661 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 15:51:21,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:51:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:51:21,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:22,173 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 5 [2018-09-19 15:51:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:51:22,307 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:51:22,322 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:51:22,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 15:51:22,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 15:51:22,323 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 15:51:22,323 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-19 15:51:22,324 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2018-09-19 15:51:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:51:26,869 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-09-19 15:51:26,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 15:51:26,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-09-19 15:51:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:51:26,872 INFO L225 Difference]: With dead ends: 35 [2018-09-19 15:51:26,872 INFO L226 Difference]: Without dead ends: 33 [2018-09-19 15:51:26,873 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-19 15:51:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-19 15:51:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-09-19 15:51:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-19 15:51:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-09-19 15:51:26,881 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 16 [2018-09-19 15:51:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:51:26,882 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-09-19 15:51:26,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 15:51:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-09-19 15:51:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-19 15:51:26,883 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:26,884 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:26,884 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:26,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1288289739, now seen corresponding path program 1 times [2018-09-19 15:51:26,885 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:26,885 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 15:51:26,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:51:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:51:27,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-19 15:51:27,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:51:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-19 15:51:27,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:51:27,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-19 15:51:27,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 15:51:27,299 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 15:51:27,300 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 15:51:27,300 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 6 states. [2018-09-19 15:51:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:51:31,661 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-09-19 15:51:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 15:51:31,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-09-19 15:51:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:51:31,663 INFO L225 Difference]: With dead ends: 44 [2018-09-19 15:51:31,664 INFO L226 Difference]: Without dead ends: 37 [2018-09-19 15:51:31,664 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 15:51:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-19 15:51:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-19 15:51:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-19 15:51:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-09-19 15:51:31,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-09-19 15:51:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:51:31,677 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-09-19 15:51:31,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 15:51:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-09-19 15:51:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-19 15:51:31,678 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:31,678 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:31,679 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1286561861, now seen corresponding path program 1 times [2018-09-19 15:51:31,679 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:31,680 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 15:51:31,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:51:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:51:32,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-19 15:51:32,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:51:34,508 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE ((_ to_fp 8 24) RNE 3.0) c_main_~x1~0) .cse1) (fp.div RNE c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from false [2018-09-19 15:51:38,459 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2))) .cse2) (fp.div RNE (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-09-19 15:51:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2018-09-19 15:51:40,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:51:40,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-19 15:51:40,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 15:51:40,559 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 15:51:40,559 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=70, Unknown=2, NotChecked=34, Total=132 [2018-09-19 15:51:40,560 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2018-09-19 15:51:42,701 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2))) .cse2) (fp.div RNE (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 ((_ to_fp 8 24) RNE 16.0)) (= c_main_~x1~0 ((_ to_fp 8 24) RNE 12.0)))) is different from true [2018-09-19 15:51:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:51:50,824 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-09-19 15:51:50,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 15:51:50,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-09-19 15:51:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:51:50,831 INFO L225 Difference]: With dead ends: 43 [2018-09-19 15:51:50,831 INFO L226 Difference]: Without dead ends: 41 [2018-09-19 15:51:50,832 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=34, Invalid=85, Unknown=3, NotChecked=60, Total=182 [2018-09-19 15:51:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-19 15:51:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-19 15:51:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-19 15:51:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-09-19 15:51:50,843 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2018-09-19 15:51:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:51:50,844 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-09-19 15:51:50,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 15:51:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-09-19 15:51:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-19 15:51:50,845 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:50,845 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:50,846 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:50,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2086466210, now seen corresponding path program 2 times [2018-09-19 15:51:50,847 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:50,847 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:51:50,856 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 15:51:51,199 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:51:51,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:51:51,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-19 15:51:51,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:51:53,448 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE c_main_~x1~0 .cse1) (fp.div RNE (fp.mul RNE ((_ to_fp 8 24) RNE 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from false [2018-09-19 15:51:55,477 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE c_main_~x1~0 .cse1) (fp.div RNE (fp.mul RNE ((_ to_fp 8 24) RNE 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from true [2018-09-19 15:51:57,558 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2)) .cse2) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from false [2018-09-19 15:51:59,628 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2)) .cse2) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from true [2018-09-19 15:51:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2018-09-19 15:51:59,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:51:59,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-19 15:51:59,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 15:51:59,700 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 15:51:59,700 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=68, Unknown=4, NotChecked=34, Total=132 [2018-09-19 15:51:59,701 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-09-19 15:52:01,789 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2)) .cse2) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (= c_main_~y1~0 ((_ to_fp 8 24) RNE 16.0)) (= c_main_~x1~0 ((_ to_fp 8 24) RNE 12.0)))) is different from true [2018-09-19 15:52:03,821 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse1 ((_ to_fp 8 24) RNE 12.0)) (.cse3 ((_ to_fp 8 24) RNE 16.0)) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse0 c_main_~y1~0) .cse2)))) (and (= (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse1) .cse2) (fp.div RNE .cse3 .cse2)) c_main_~x1~0) (= (fp.add RNE (fp.div RNE .cse1 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse3) .cse2)) c_main_~y1~0) (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) RNE 100.0))))) is different from true [2018-09-19 15:52:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:52:13,633 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-09-19 15:52:13,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 15:52:13,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-09-19 15:52:13,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:52:13,641 INFO L225 Difference]: With dead ends: 47 [2018-09-19 15:52:13,641 INFO L226 Difference]: Without dead ends: 45 [2018-09-19 15:52:13,642 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=36, Invalid=84, Unknown=6, NotChecked=84, Total=210 [2018-09-19 15:52:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-19 15:52:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-19 15:52:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-19 15:52:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-09-19 15:52:13,654 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 29 [2018-09-19 15:52:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:52:13,655 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-09-19 15:52:13,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 15:52:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-09-19 15:52:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-19 15:52:13,656 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:52:13,656 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:52:13,657 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:52:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1658292829, now seen corresponding path program 3 times [2018-09-19 15:52:13,657 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:52:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 15:52:13,666 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-09-19 15:52:14,308 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-19 15:52:14,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:52:14,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:52:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-19 15:52:14,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:52:16,654 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE ((_ to_fp 8 24) RNE 3.0) c_main_~x1~0) .cse1) (fp.div RNE c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from false [2018-09-19 15:52:18,684 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE ((_ to_fp 8 24) RNE 3.0) c_main_~x1~0) .cse1) (fp.div RNE c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from true [2018-09-19 15:52:20,809 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2))) .cse2) (fp.div RNE (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-09-19 15:52:22,889 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2))) .cse2) (fp.div RNE (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-09-19 15:52:25,039 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-09-19 15:52:27,158 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-09-19 15:52:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 11 not checked. [2018-09-19 15:52:27,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:52:27,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-19 15:52:27,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 15:52:27,228 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 15:52:27,228 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=85, Unknown=6, NotChecked=60, Total=182 [2018-09-19 15:52:27,228 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 14 states. [2018-09-19 15:52:29,367 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 ((_ to_fp 8 24) RNE 16.0)) (= c_main_~x1~0 ((_ to_fp 8 24) RNE 12.0)))) is different from true [2018-09-19 15:52:31,458 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse1 ((_ to_fp 8 24) RNE 12.0)) (.cse3 ((_ to_fp 8 24) RNE 16.0)) (.cse4 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2))) .cse2) (fp.div RNE (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse0 c_main_~y1~0) .cse2)) .cse2)))) (and (= (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse1) .cse2) (fp.div RNE .cse3 .cse2)) c_main_~x1~0) (= (fp.add RNE (fp.div RNE .cse1 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse3) .cse2)) c_main_~y1~0) (fp.leq .cse4 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse4 (_ +zero 8 24))))) is different from true [2018-09-19 15:52:36,109 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE 3.0)) (.cse5 ((_ to_fp 8 24) RNE 12.0)) (.cse6 ((_ to_fp 8 24) RNE 16.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse5) .cse2) (fp.div RNE .cse6 .cse2))) (.cse3 (fp.add RNE (fp.div RNE .cse5 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse6) .cse2))) (.cse4 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2)))) (and (= c_main_~x1~0 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse1) .cse2) (fp.div RNE .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (= c_main_~y1~0 (fp.add RNE (fp.div RNE .cse1 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse3) .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) RNE 100.0))))) is different from true [2018-09-19 15:52:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:52:48,818 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-09-19 15:52:48,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 15:52:48,868 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-09-19 15:52:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:52:48,870 INFO L225 Difference]: With dead ends: 57 [2018-09-19 15:52:48,870 INFO L226 Difference]: Without dead ends: 55 [2018-09-19 15:52:48,870 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=43, Invalid=104, Unknown=9, NotChecked=150, Total=306 [2018-09-19 15:52:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-19 15:52:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-09-19 15:52:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-19 15:52:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-09-19 15:52:48,885 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 37 [2018-09-19 15:52:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:52:48,885 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-09-19 15:52:48,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 15:52:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-09-19 15:52:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-19 15:52:48,887 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:52:48,887 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:52:48,887 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:52:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash -95455236, now seen corresponding path program 4 times [2018-09-19 15:52:48,888 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:52:48,888 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 15:52:48,892 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-19 15:52:49,388 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-19 15:52:49,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:52:49,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:52:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-19 15:52:49,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:52:51,807 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE c_main_~x1~0 .cse1) (fp.div RNE (fp.mul RNE ((_ to_fp 8 24) RNE 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from false [2018-09-19 15:52:53,831 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE c_main_~x1~0 .cse1) (fp.div RNE (fp.mul RNE ((_ to_fp 8 24) RNE 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from true [2018-09-19 15:52:55,910 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2)) .cse2) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from false [2018-09-19 15:52:57,983 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2)) .cse2) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from true [2018-09-19 15:53:00,135 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3)) .cse3) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-09-19 15:53:02,259 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3)) .cse3) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-09-19 15:53:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 13 not checked. [2018-09-19 15:53:02,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:53:02,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-19 15:53:02,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 15:53:02,317 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 15:53:02,317 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=85, Unknown=6, NotChecked=60, Total=182 [2018-09-19 15:53:02,318 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2018-09-19 15:53:04,522 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3)) .cse3) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 ((_ to_fp 8 24) RNE 16.0)) (= c_main_~x1~0 ((_ to_fp 8 24) RNE 12.0)))) is different from true [2018-09-19 15:53:06,611 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 ((_ to_fp 8 24) RNE 12.0)) (.cse4 ((_ to_fp 8 24) RNE 16.0)) (.cse0 (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3)) .cse3) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3))) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3)) c_main_~x1~0) (= (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) c_main_~y1~0) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0))))) is different from false [2018-09-19 15:53:08,686 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 ((_ to_fp 8 24) RNE 12.0)) (.cse4 ((_ to_fp 8 24) RNE 16.0)) (.cse0 (fp.add RNE (fp.div RNE (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3)) .cse3) (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3))) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3)) c_main_~x1~0) (= (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) c_main_~y1~0) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0))))) is different from true [2018-09-19 15:53:10,728 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 12.0)) (.cse6 ((_ to_fp 8 24) RNE 16.0)) (.cse0 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse0 c_main_~y1~0) .cse2))) (.cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse5) .cse2) (fp.div RNE .cse6 .cse2))) (.cse3 (fp.add RNE (fp.div RNE .cse5 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse6) .cse2)))) (and (= c_main_~x1~0 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse1) .cse2) (fp.div RNE .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) RNE 100.0)) (= c_main_~y1~0 (fp.add RNE (fp.div RNE .cse1 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse3) .cse2)))))) is different from true [2018-09-19 15:53:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:53:13,014 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-09-19 15:53:13,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-19 15:53:13,015 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-09-19 15:53:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:53:13,017 INFO L225 Difference]: With dead ends: 61 [2018-09-19 15:53:13,017 INFO L226 Difference]: Without dead ends: 59 [2018-09-19 15:53:13,018 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=43, Invalid=103, Unknown=10, NotChecked=150, Total=306 [2018-09-19 15:53:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-19 15:53:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-09-19 15:53:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-19 15:53:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-09-19 15:53:13,034 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2018-09-19 15:53:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:53:13,034 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-09-19 15:53:13,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 15:53:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-09-19 15:53:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-19 15:53:13,036 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:53:13,036 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:53:13,037 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:53:13,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1167858037, now seen corresponding path program 2 times [2018-09-19 15:53:13,037 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:53:13,038 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:53:13,052 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-19 15:53:13,572 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:53:13,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:53:13,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-19 15:53:13,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:53:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-19 15:53:13,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:53:13,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-09-19 15:53:13,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 15:53:13,795 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 15:53:13,795 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-09-19 15:53:13,795 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 10 states. [2018-09-19 15:53:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:53:22,813 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-09-19 15:53:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:53:22,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-09-19 15:53:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:53:22,816 INFO L225 Difference]: With dead ends: 80 [2018-09-19 15:53:22,816 INFO L226 Difference]: Without dead ends: 73 [2018-09-19 15:53:22,817 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-09-19 15:53:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-19 15:53:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-19 15:53:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-19 15:53:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-09-19 15:53:22,836 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 50 [2018-09-19 15:53:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:53:22,836 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-09-19 15:53:22,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 15:53:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-09-19 15:53:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-19 15:53:22,838 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:53:22,838 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:53:22,838 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:53:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1169585915, now seen corresponding path program 5 times [2018-09-19 15:53:22,839 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:53:22,839 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-19 15:53:22,843 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-09-19 15:53:23,628 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-09-19 15:53:23,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:53:23,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-19 15:53:24,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:53:26,162 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE ((_ to_fp 8 24) RNE 3.0) c_main_~x1~0) .cse1) (fp.div RNE c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from false [2018-09-19 15:53:28,188 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE ((_ to_fp 8 24) RNE 3.0) c_main_~x1~0) .cse1) (fp.div RNE c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)))) is different from true [2018-09-19 15:53:30,295 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2))) .cse2) (fp.div RNE (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-09-19 15:53:32,375 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2))) .cse2) (fp.div RNE (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-09-19 15:53:34,520 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-09-19 15:53:36,663 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-09-19 15:53:36,926 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 15:53:39,166 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) RNE 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (let ((.cse4 ((_ to_fp 8 24) RNE 3.0)) (.cse6 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse5 (fp.add RNE (fp.div RNE (fp.mul RNE .cse4 c_main_~x1~0) .cse6) (fp.div RNE c_main_~y1~0 .cse6))) (.cse7 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse6) (fp.div RNE (fp.mul RNE .cse4 c_main_~y1~0) .cse6)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse4 (fp.add RNE (fp.div RNE (fp.mul RNE .cse4 .cse5) .cse6) (fp.div RNE .cse7 .cse6))) .cse6) (fp.div RNE (fp.add RNE (fp.div RNE .cse5 .cse6) (fp.div RNE (fp.mul RNE .cse4 .cse7) .cse6)) .cse6))))) (.cse3 (not (fp.leq c_main_~y1~0 .cse2)))) (and (or .cse0 (fp.leq .cse1 .cse2) .cse3) (or .cse0 (fp.geq .cse1 (_ +zero 8 24)) .cse3)))) is different from false [2018-09-19 15:53:41,292 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) RNE 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (let ((.cse4 ((_ to_fp 8 24) RNE 3.0)) (.cse6 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse5 (fp.add RNE (fp.div RNE (fp.mul RNE .cse4 c_main_~x1~0) .cse6) (fp.div RNE c_main_~y1~0 .cse6))) (.cse7 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse6) (fp.div RNE (fp.mul RNE .cse4 c_main_~y1~0) .cse6)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse4 (fp.add RNE (fp.div RNE (fp.mul RNE .cse4 .cse5) .cse6) (fp.div RNE .cse7 .cse6))) .cse6) (fp.div RNE (fp.add RNE (fp.div RNE .cse5 .cse6) (fp.div RNE (fp.mul RNE .cse4 .cse7) .cse6)) .cse6))))) (.cse3 (not (fp.leq c_main_~y1~0 .cse2)))) (and (or .cse0 (fp.leq .cse1 .cse2) .cse3) (or .cse0 (fp.geq .cse1 (_ +zero 8 24)) .cse3)))) is different from true [2018-09-19 15:54:07,980 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 (forall ((v_prenex_12 (_ FloatingPoint 8 24)) (v_prenex_11 (_ FloatingPoint 8 24))) (or (fp.geq v_prenex_11 (_ +zero 8 24)) (fp.leq v_prenex_11 ((_ to_fp 8 24) RNE 100.0)) (fp.geq (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 v_prenex_12) .cse3) (fp.div RNE v_prenex_11 .cse3))) (.cse4 (fp.add RNE (fp.div RNE v_prenex_12 .cse3) (fp.div RNE (fp.mul RNE .cse1 v_prenex_11) .cse3)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) .cse3)))) (_ +zero 8 24))))) (or .cse0 (forall ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse5 ((_ to_fp 8 24) RNE 3.0)) (.cse7 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse6 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 v_prenex_3) .cse7) (fp.div RNE v_prenex_4 .cse7))) (.cse8 (fp.add RNE (fp.div RNE v_prenex_3 .cse7) (fp.div RNE (fp.mul RNE .cse5 v_prenex_4) .cse7)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 .cse6) .cse7) (fp.div RNE .cse8 .cse7))) .cse7) (fp.div RNE (fp.add RNE (fp.div RNE .cse6 .cse7) (fp.div RNE (fp.mul RNE .cse5 .cse8) .cse7)) .cse7)))) ((_ to_fp 8 24) RNE 100.0)) (fp.geq v_prenex_4 (_ +zero 8 24))))) (or .cse0 (forall ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse9 ((_ to_fp 8 24) RNE 3.0)) (.cse11 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse10 (fp.add RNE (fp.div RNE (fp.mul RNE .cse9 v_prenex_7) .cse11) (fp.div RNE v_prenex_8 .cse11))) (.cse12 (fp.add RNE (fp.div RNE v_prenex_7 .cse11) (fp.div RNE (fp.mul RNE .cse9 v_prenex_8) .cse11)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse9 (fp.add RNE (fp.div RNE (fp.mul RNE .cse9 .cse10) .cse11) (fp.div RNE .cse12 .cse11))) .cse11) (fp.div RNE (fp.add RNE (fp.div RNE .cse10 .cse11) (fp.div RNE (fp.mul RNE .cse9 .cse12) .cse11)) .cse11)))) (_ +zero 8 24)) (fp.leq v_prenex_8 ((_ to_fp 8 24) RNE 100.0))))) (or .cse0 (forall ((v_prenex_9 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse13 (let ((.cse15 ((_ to_fp 8 24) RNE 3.0)) (.cse17 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse16 (fp.add RNE (fp.div RNE (fp.mul RNE .cse15 v_prenex_9) .cse17) (fp.div RNE v_prenex_10 .cse17))) (.cse18 (fp.add RNE (fp.div RNE v_prenex_9 .cse17) (fp.div RNE (fp.mul RNE .cse15 v_prenex_10) .cse17)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse15 (fp.add RNE (fp.div RNE (fp.mul RNE .cse15 .cse16) .cse17) (fp.div RNE .cse18 .cse17))) .cse17) (fp.div RNE (fp.add RNE (fp.div RNE .cse16 .cse17) (fp.div RNE (fp.mul RNE .cse15 .cse18) .cse17)) .cse17))))) (.cse14 ((_ to_fp 8 24) RNE 100.0))) (or (fp.geq .cse13 (_ +zero 8 24)) (not (fp.leq .cse13 .cse14)) (fp.leq v_prenex_10 .cse14))))) (or .cse0 (forall ((v_prenex_14 (_ FloatingPoint 8 24)) (v_prenex_13 (_ FloatingPoint 8 24))) (let ((.cse19 ((_ to_fp 8 24) RNE 100.0)) (.cse20 (let ((.cse21 ((_ to_fp 8 24) RNE 3.0)) (.cse23 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse22 (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 v_prenex_14) .cse23) (fp.div RNE v_prenex_13 .cse23))) (.cse24 (fp.add RNE (fp.div RNE v_prenex_14 .cse23) (fp.div RNE (fp.mul RNE .cse21 v_prenex_13) .cse23)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 .cse22) .cse23) (fp.div RNE .cse24 .cse23))) .cse23) (fp.div RNE (fp.add RNE (fp.div RNE .cse22 .cse23) (fp.div RNE (fp.mul RNE .cse21 .cse24) .cse23)) .cse23)))))) (or (fp.leq v_prenex_13 .cse19) (fp.leq .cse20 .cse19) (not (fp.geq .cse20 (_ +zero 8 24))))))) (or .cse0 (forall ((v_prenex_16 (_ FloatingPoint 8 24)) (v_prenex_15 (_ FloatingPoint 8 24))) (let ((.cse25 (let ((.cse26 ((_ to_fp 8 24) RNE 3.0)) (.cse28 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse27 (fp.add RNE (fp.div RNE (fp.mul RNE .cse26 v_prenex_16) .cse28) (fp.div RNE v_prenex_15 .cse28))) (.cse29 (fp.add RNE (fp.div RNE v_prenex_16 .cse28) (fp.div RNE (fp.mul RNE .cse26 v_prenex_15) .cse28)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse26 (fp.add RNE (fp.div RNE (fp.mul RNE .cse26 .cse27) .cse28) (fp.div RNE .cse29 .cse28))) .cse28) (fp.div RNE (fp.add RNE (fp.div RNE .cse27 .cse28) (fp.div RNE (fp.mul RNE .cse26 .cse29) .cse28)) .cse28)))))) (or (fp.geq v_prenex_15 (_ +zero 8 24)) (fp.leq .cse25 ((_ to_fp 8 24) RNE 100.0)) (not (fp.geq .cse25 (_ +zero 8 24))))))) (or (forall ((v_main_~x1~0_BEFORE_CALL_39 (_ FloatingPoint 8 24)) (v_main_~y1~0_BEFORE_CALL_43 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_43 (_ +zero 8 24)) (fp.geq (let ((.cse30 ((_ to_fp 8 24) RNE 3.0)) (.cse32 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse31 (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 v_main_~x1~0_BEFORE_CALL_39) .cse32) (fp.div RNE v_main_~y1~0_BEFORE_CALL_43 .cse32))) (.cse33 (fp.add RNE (fp.div RNE v_main_~x1~0_BEFORE_CALL_39 .cse32) (fp.div RNE (fp.mul RNE .cse30 v_main_~y1~0_BEFORE_CALL_43) .cse32)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 .cse31) .cse32) (fp.div RNE .cse33 .cse32))) .cse32) (fp.div RNE (fp.add RNE (fp.div RNE .cse31 .cse32) (fp.div RNE (fp.mul RNE .cse30 .cse33) .cse32)) .cse32)))) (_ +zero 8 24)))) .cse0) (or .cse0 (forall ((v_prenex_5 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse34 ((_ to_fp 8 24) RNE 100.0))) (or (fp.leq v_prenex_6 .cse34) (fp.leq (let ((.cse35 ((_ to_fp 8 24) RNE 3.0)) (.cse37 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse36 (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 v_prenex_5) .cse37) (fp.div RNE v_prenex_6 .cse37))) (.cse38 (fp.add RNE (fp.div RNE v_prenex_5 .cse37) (fp.div RNE (fp.mul RNE .cse35 v_prenex_6) .cse37)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 .cse36) .cse37) (fp.div RNE .cse38 .cse37))) .cse37) (fp.div RNE (fp.add RNE (fp.div RNE .cse36 .cse37) (fp.div RNE (fp.mul RNE .cse35 .cse38) .cse37)) .cse37)))) .cse34))))) (or .cse0 (forall ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse43 ((_ to_fp 8 24) RNE 100.0))) (or (fp.leq (let ((.cse39 ((_ to_fp 8 24) RNE 3.0)) (.cse41 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse40 (fp.add RNE (fp.div RNE (fp.mul RNE .cse39 v_prenex_1) .cse41) (fp.div RNE v_prenex_2 .cse41))) (.cse42 (fp.add RNE (fp.div RNE v_prenex_1 .cse41) (fp.div RNE (fp.mul RNE .cse39 v_prenex_2) .cse41)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse39 (fp.add RNE (fp.div RNE (fp.mul RNE .cse39 .cse40) .cse41) (fp.div RNE .cse42 .cse41))) .cse41) (fp.div RNE (fp.add RNE (fp.div RNE .cse40 .cse41) (fp.div RNE (fp.mul RNE .cse39 .cse42) .cse41)) .cse41)))) .cse43) (fp.geq v_prenex_2 (_ +zero 8 24)) (fp.leq v_prenex_2 .cse43))))) (or .cse0 (forall ((v_prenex_18 (_ FloatingPoint 8 24)) (v_prenex_17 (_ FloatingPoint 8 24))) (let ((.cse44 (let ((.cse45 ((_ to_fp 8 24) RNE 3.0)) (.cse47 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse46 (fp.add RNE (fp.div RNE (fp.mul RNE .cse45 v_prenex_18) .cse47) (fp.div RNE v_prenex_17 .cse47))) (.cse48 (fp.add RNE (fp.div RNE v_prenex_18 .cse47) (fp.div RNE (fp.mul RNE .cse45 v_prenex_17) .cse47)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse45 (fp.add RNE (fp.div RNE (fp.mul RNE .cse45 .cse46) .cse47) (fp.div RNE .cse48 .cse47))) .cse47) (fp.div RNE (fp.add RNE (fp.div RNE .cse46 .cse47) (fp.div RNE (fp.mul RNE .cse45 .cse48) .cse47)) .cse47)))))) (or (fp.geq v_prenex_17 (_ +zero 8 24)) (not (fp.leq .cse44 ((_ to_fp 8 24) RNE 100.0))) (fp.geq .cse44 (_ +zero 8 24)))))))) is different from true [2018-09-19 15:55:36,187 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 .cse1 (forall ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse2 ((_ to_fp 8 24) RNE 3.0)) (.cse4 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse3 (fp.add RNE (fp.div RNE (fp.mul RNE .cse2 v_prenex_7) .cse4) (fp.div RNE v_prenex_8 .cse4))) (.cse5 (fp.add RNE (fp.div RNE v_prenex_7 .cse4) (fp.div RNE (fp.mul RNE .cse2 v_prenex_8) .cse4)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse2 .cse3) .cse4) (fp.div RNE .cse5 .cse4))) .cse4) (fp.div RNE (fp.add RNE (fp.div RNE .cse3 .cse4) (fp.div RNE (fp.mul RNE .cse2 .cse5) .cse4)) .cse4)))) (_ +zero 8 24)) (fp.leq v_prenex_8 ((_ to_fp 8 24) RNE 100.0))))) (or .cse0 .cse1 (forall ((v_prenex_14 (_ FloatingPoint 8 24)) (v_prenex_13 (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 8 24) RNE 100.0)) (.cse7 (let ((.cse8 ((_ to_fp 8 24) RNE 3.0)) (.cse10 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse9 (fp.add RNE (fp.div RNE (fp.mul RNE .cse8 v_prenex_14) .cse10) (fp.div RNE v_prenex_13 .cse10))) (.cse11 (fp.add RNE (fp.div RNE v_prenex_14 .cse10) (fp.div RNE (fp.mul RNE .cse8 v_prenex_13) .cse10)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse8 (fp.add RNE (fp.div RNE (fp.mul RNE .cse8 .cse9) .cse10) (fp.div RNE .cse11 .cse10))) .cse10) (fp.div RNE (fp.add RNE (fp.div RNE .cse9 .cse10) (fp.div RNE (fp.mul RNE .cse8 .cse11) .cse10)) .cse10)))))) (or (fp.leq v_prenex_13 .cse6) (fp.leq .cse7 .cse6) (not (fp.geq .cse7 (_ +zero 8 24))))))) (or .cse0 .cse1 (forall ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse16 ((_ to_fp 8 24) RNE 100.0))) (or (fp.leq (let ((.cse12 ((_ to_fp 8 24) RNE 3.0)) (.cse14 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse13 (fp.add RNE (fp.div RNE (fp.mul RNE .cse12 v_prenex_1) .cse14) (fp.div RNE v_prenex_2 .cse14))) (.cse15 (fp.add RNE (fp.div RNE v_prenex_1 .cse14) (fp.div RNE (fp.mul RNE .cse12 v_prenex_2) .cse14)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse12 (fp.add RNE (fp.div RNE (fp.mul RNE .cse12 .cse13) .cse14) (fp.div RNE .cse15 .cse14))) .cse14) (fp.div RNE (fp.add RNE (fp.div RNE .cse13 .cse14) (fp.div RNE (fp.mul RNE .cse12 .cse15) .cse14)) .cse14)))) .cse16) (fp.geq v_prenex_2 (_ +zero 8 24)) (fp.leq v_prenex_2 .cse16))))) (or .cse0 .cse1 (forall ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse17 ((_ to_fp 8 24) RNE 3.0)) (.cse19 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse18 (fp.add RNE (fp.div RNE (fp.mul RNE .cse17 v_prenex_3) .cse19) (fp.div RNE v_prenex_4 .cse19))) (.cse20 (fp.add RNE (fp.div RNE v_prenex_3 .cse19) (fp.div RNE (fp.mul RNE .cse17 v_prenex_4) .cse19)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse17 (fp.add RNE (fp.div RNE (fp.mul RNE .cse17 .cse18) .cse19) (fp.div RNE .cse20 .cse19))) .cse19) (fp.div RNE (fp.add RNE (fp.div RNE .cse18 .cse19) (fp.div RNE (fp.mul RNE .cse17 .cse20) .cse19)) .cse19)))) ((_ to_fp 8 24) RNE 100.0)) (fp.geq v_prenex_4 (_ +zero 8 24))))) (or .cse0 .cse1 (forall ((v_prenex_12 (_ FloatingPoint 8 24)) (v_prenex_11 (_ FloatingPoint 8 24))) (or (fp.geq v_prenex_11 (_ +zero 8 24)) (fp.leq v_prenex_11 ((_ to_fp 8 24) RNE 100.0)) (fp.geq (let ((.cse21 ((_ to_fp 8 24) RNE 3.0)) (.cse23 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse22 (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 v_prenex_12) .cse23) (fp.div RNE v_prenex_11 .cse23))) (.cse24 (fp.add RNE (fp.div RNE v_prenex_12 .cse23) (fp.div RNE (fp.mul RNE .cse21 v_prenex_11) .cse23)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 .cse22) .cse23) (fp.div RNE .cse24 .cse23))) .cse23) (fp.div RNE (fp.add RNE (fp.div RNE .cse22 .cse23) (fp.div RNE (fp.mul RNE .cse21 .cse24) .cse23)) .cse23)))) (_ +zero 8 24))))) (or (forall ((v_main_~x1~0_BEFORE_CALL_39 (_ FloatingPoint 8 24)) (v_main_~y1~0_BEFORE_CALL_43 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_43 (_ +zero 8 24)) (fp.geq (let ((.cse25 ((_ to_fp 8 24) RNE 3.0)) (.cse27 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse26 (fp.add RNE (fp.div RNE (fp.mul RNE .cse25 v_main_~x1~0_BEFORE_CALL_39) .cse27) (fp.div RNE v_main_~y1~0_BEFORE_CALL_43 .cse27))) (.cse28 (fp.add RNE (fp.div RNE v_main_~x1~0_BEFORE_CALL_39 .cse27) (fp.div RNE (fp.mul RNE .cse25 v_main_~y1~0_BEFORE_CALL_43) .cse27)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse25 (fp.add RNE (fp.div RNE (fp.mul RNE .cse25 .cse26) .cse27) (fp.div RNE .cse28 .cse27))) .cse27) (fp.div RNE (fp.add RNE (fp.div RNE .cse26 .cse27) (fp.div RNE (fp.mul RNE .cse25 .cse28) .cse27)) .cse27)))) (_ +zero 8 24)))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_prenex_18 (_ FloatingPoint 8 24)) (v_prenex_17 (_ FloatingPoint 8 24))) (let ((.cse29 (let ((.cse30 ((_ to_fp 8 24) RNE 3.0)) (.cse32 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse31 (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 v_prenex_18) .cse32) (fp.div RNE v_prenex_17 .cse32))) (.cse33 (fp.add RNE (fp.div RNE v_prenex_18 .cse32) (fp.div RNE (fp.mul RNE .cse30 v_prenex_17) .cse32)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 .cse31) .cse32) (fp.div RNE .cse33 .cse32))) .cse32) (fp.div RNE (fp.add RNE (fp.div RNE .cse31 .cse32) (fp.div RNE (fp.mul RNE .cse30 .cse33) .cse32)) .cse32)))))) (or (fp.geq v_prenex_17 (_ +zero 8 24)) (not (fp.leq .cse29 ((_ to_fp 8 24) RNE 100.0))) (fp.geq .cse29 (_ +zero 8 24)))))) (or .cse0 .cse1 (forall ((v_prenex_16 (_ FloatingPoint 8 24)) (v_prenex_15 (_ FloatingPoint 8 24))) (let ((.cse34 (let ((.cse35 ((_ to_fp 8 24) RNE 3.0)) (.cse37 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse36 (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 v_prenex_16) .cse37) (fp.div RNE v_prenex_15 .cse37))) (.cse38 (fp.add RNE (fp.div RNE v_prenex_16 .cse37) (fp.div RNE (fp.mul RNE .cse35 v_prenex_15) .cse37)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 .cse36) .cse37) (fp.div RNE .cse38 .cse37))) .cse37) (fp.div RNE (fp.add RNE (fp.div RNE .cse36 .cse37) (fp.div RNE (fp.mul RNE .cse35 .cse38) .cse37)) .cse37)))))) (or (fp.geq v_prenex_15 (_ +zero 8 24)) (fp.leq .cse34 ((_ to_fp 8 24) RNE 100.0)) (not (fp.geq .cse34 (_ +zero 8 24))))))) (or .cse0 .cse1 (forall ((v_prenex_9 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse39 (let ((.cse41 ((_ to_fp 8 24) RNE 3.0)) (.cse43 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse42 (fp.add RNE (fp.div RNE (fp.mul RNE .cse41 v_prenex_9) .cse43) (fp.div RNE v_prenex_10 .cse43))) (.cse44 (fp.add RNE (fp.div RNE v_prenex_9 .cse43) (fp.div RNE (fp.mul RNE .cse41 v_prenex_10) .cse43)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse41 (fp.add RNE (fp.div RNE (fp.mul RNE .cse41 .cse42) .cse43) (fp.div RNE .cse44 .cse43))) .cse43) (fp.div RNE (fp.add RNE (fp.div RNE .cse42 .cse43) (fp.div RNE (fp.mul RNE .cse41 .cse44) .cse43)) .cse43))))) (.cse40 ((_ to_fp 8 24) RNE 100.0))) (or (fp.geq .cse39 (_ +zero 8 24)) (not (fp.leq .cse39 .cse40)) (fp.leq v_prenex_10 .cse40))))) (or .cse0 .cse1 (forall ((v_prenex_5 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse45 ((_ to_fp 8 24) RNE 100.0))) (or (fp.leq v_prenex_6 .cse45) (fp.leq (let ((.cse46 ((_ to_fp 8 24) RNE 3.0)) (.cse48 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse47 (fp.add RNE (fp.div RNE (fp.mul RNE .cse46 v_prenex_5) .cse48) (fp.div RNE v_prenex_6 .cse48))) (.cse49 (fp.add RNE (fp.div RNE v_prenex_5 .cse48) (fp.div RNE (fp.mul RNE .cse46 v_prenex_6) .cse48)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse46 (fp.add RNE (fp.div RNE (fp.mul RNE .cse46 .cse47) .cse48) (fp.div RNE .cse49 .cse48))) .cse48) (fp.div RNE (fp.add RNE (fp.div RNE .cse47 .cse48) (fp.div RNE (fp.mul RNE .cse46 .cse49) .cse48)) .cse48)))) .cse45))))))) is different from true [2018-09-19 15:55:38,443 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 3.0)) (.cse7 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse3 ((_ to_fp 8 24) RNE 100.0)) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse7) (fp.div RNE (fp.mul RNE .cse5 c_main_~y1~0) .cse7)))) (let ((.cse2 (let ((.cse9 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 c_main_~x1~0) .cse7) (fp.div RNE c_main_~y1~0 .cse7)))) (let ((.cse6 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 .cse9) .cse7) (fp.div RNE .cse4 .cse7))) (.cse8 (fp.add RNE (fp.div RNE .cse9 .cse7) (fp.div RNE (fp.mul RNE .cse5 .cse4) .cse7)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 .cse6) .cse7) (fp.div RNE .cse8 .cse7))) .cse7) (fp.div RNE (fp.add RNE (fp.div RNE .cse6 .cse7) (fp.div RNE (fp.mul RNE .cse5 .cse8) .cse7)) .cse7))))) (.cse0 (not (fp.geq .cse4 (_ +zero 8 24)))) (.cse1 (not (fp.leq .cse4 .cse3)))) (and (or .cse0 .cse1 (fp.geq .cse2 (_ +zero 8 24))) (or (fp.leq .cse2 .cse3) .cse0 .cse1))))) is different from false [2018-09-19 15:55:40,631 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 3.0)) (.cse7 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse3 ((_ to_fp 8 24) RNE 100.0)) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse7) (fp.div RNE (fp.mul RNE .cse5 c_main_~y1~0) .cse7)))) (let ((.cse2 (let ((.cse9 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 c_main_~x1~0) .cse7) (fp.div RNE c_main_~y1~0 .cse7)))) (let ((.cse6 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 .cse9) .cse7) (fp.div RNE .cse4 .cse7))) (.cse8 (fp.add RNE (fp.div RNE .cse9 .cse7) (fp.div RNE (fp.mul RNE .cse5 .cse4) .cse7)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 .cse6) .cse7) (fp.div RNE .cse8 .cse7))) .cse7) (fp.div RNE (fp.add RNE (fp.div RNE .cse6 .cse7) (fp.div RNE (fp.mul RNE .cse5 .cse8) .cse7)) .cse7))))) (.cse0 (not (fp.geq .cse4 (_ +zero 8 24)))) (.cse1 (not (fp.leq .cse4 .cse3)))) (and (or .cse0 .cse1 (fp.geq .cse2 (_ +zero 8 24))) (or (fp.leq .cse2 .cse3) .cse0 .cse1))))) is different from true [2018-09-19 15:55:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 14 proven. 0 refuted. 12 times theorem prover too weak. 45 trivial. 25 not checked. [2018-09-19 15:55:40,709 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:55:40,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-09-19 15:55:40,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-19 15:55:40,710 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-19 15:55:40,710 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=128, Unknown=12, NotChecked=196, Total=380 [2018-09-19 15:55:40,710 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 20 states. [2018-09-19 15:55:42,907 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 3.0)) (.cse7 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse3 ((_ to_fp 8 24) RNE 100.0)) (.cse4 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse7) (fp.div RNE (fp.mul RNE .cse5 c_main_~y1~0) .cse7)))) (let ((.cse2 (let ((.cse9 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 c_main_~x1~0) .cse7) (fp.div RNE c_main_~y1~0 .cse7)))) (let ((.cse6 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 .cse9) .cse7) (fp.div RNE .cse4 .cse7))) (.cse8 (fp.add RNE (fp.div RNE .cse9 .cse7) (fp.div RNE (fp.mul RNE .cse5 .cse4) .cse7)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 .cse6) .cse7) (fp.div RNE .cse8 .cse7))) .cse7) (fp.div RNE (fp.add RNE (fp.div RNE .cse6 .cse7) (fp.div RNE (fp.mul RNE .cse5 .cse8) .cse7)) .cse7))))) (.cse0 (not (fp.geq .cse4 (_ +zero 8 24)))) (.cse1 (not (fp.leq .cse4 .cse3)))) (and (or .cse0 .cse1 (fp.geq .cse2 (_ +zero 8 24))) (or (fp.leq .cse2 .cse3) .cse0 .cse1) (= c_main_~y1~0 ((_ to_fp 8 24) RNE 16.0)) (= c_main_~x1~0 ((_ to_fp 8 24) RNE 12.0)))))) is different from true [2018-09-19 15:55:45,019 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) RNE 100.0)) (.cse0 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse1 ((_ to_fp 8 24) RNE 12.0)) (.cse3 ((_ to_fp 8 24) RNE 16.0)) (.cse4 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse5 (let ((.cse8 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2))) (.cse9 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse0 c_main_~y1~0) .cse2)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse8) .cse2) (fp.div RNE .cse9 .cse2))) .cse2) (fp.div RNE (fp.add RNE (fp.div RNE .cse8 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse9) .cse2)) .cse2)))) (.cse7 (not (fp.leq c_main_~y1~0 .cse6)))) (and (= (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse1) .cse2) (fp.div RNE .cse3 .cse2)) c_main_~x1~0) (or .cse4 (fp.leq .cse5 .cse6) .cse7) (= (fp.add RNE (fp.div RNE .cse1 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse3) .cse2)) c_main_~y1~0) (or .cse4 (fp.geq .cse5 (_ +zero 8 24)) .cse7)))) is different from false [2018-09-19 15:55:47,158 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) RNE 100.0)) (.cse0 ((_ to_fp 8 24) RNE 3.0)) (.cse2 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse1 ((_ to_fp 8 24) RNE 12.0)) (.cse3 ((_ to_fp 8 24) RNE 16.0)) (.cse4 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse5 (let ((.cse8 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 c_main_~x1~0) .cse2) (fp.div RNE c_main_~y1~0 .cse2))) (.cse9 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse2) (fp.div RNE (fp.mul RNE .cse0 c_main_~y1~0) .cse2)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse8) .cse2) (fp.div RNE .cse9 .cse2))) .cse2) (fp.div RNE (fp.add RNE (fp.div RNE .cse8 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse9) .cse2)) .cse2)))) (.cse7 (not (fp.leq c_main_~y1~0 .cse6)))) (and (= (fp.add RNE (fp.div RNE (fp.mul RNE .cse0 .cse1) .cse2) (fp.div RNE .cse3 .cse2)) c_main_~x1~0) (or .cse4 (fp.leq .cse5 .cse6) .cse7) (= (fp.add RNE (fp.div RNE .cse1 .cse2) (fp.div RNE (fp.mul RNE .cse0 .cse3) .cse2)) c_main_~y1~0) (or .cse4 (fp.geq .cse5 (_ +zero 8 24)) .cse7)))) is different from true [2018-09-19 15:55:49,794 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 .cse1 (forall ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse2 ((_ to_fp 8 24) RNE 3.0)) (.cse4 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse3 (fp.add RNE (fp.div RNE (fp.mul RNE .cse2 v_prenex_7) .cse4) (fp.div RNE v_prenex_8 .cse4))) (.cse5 (fp.add RNE (fp.div RNE v_prenex_7 .cse4) (fp.div RNE (fp.mul RNE .cse2 v_prenex_8) .cse4)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse2 .cse3) .cse4) (fp.div RNE .cse5 .cse4))) .cse4) (fp.div RNE (fp.add RNE (fp.div RNE .cse3 .cse4) (fp.div RNE (fp.mul RNE .cse2 .cse5) .cse4)) .cse4)))) (_ +zero 8 24)) (fp.leq v_prenex_8 ((_ to_fp 8 24) RNE 100.0))))) (or .cse0 .cse1 (forall ((v_prenex_14 (_ FloatingPoint 8 24)) (v_prenex_13 (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 8 24) RNE 100.0)) (.cse7 (let ((.cse8 ((_ to_fp 8 24) RNE 3.0)) (.cse10 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse9 (fp.add RNE (fp.div RNE (fp.mul RNE .cse8 v_prenex_14) .cse10) (fp.div RNE v_prenex_13 .cse10))) (.cse11 (fp.add RNE (fp.div RNE v_prenex_14 .cse10) (fp.div RNE (fp.mul RNE .cse8 v_prenex_13) .cse10)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse8 (fp.add RNE (fp.div RNE (fp.mul RNE .cse8 .cse9) .cse10) (fp.div RNE .cse11 .cse10))) .cse10) (fp.div RNE (fp.add RNE (fp.div RNE .cse9 .cse10) (fp.div RNE (fp.mul RNE .cse8 .cse11) .cse10)) .cse10)))))) (or (fp.leq v_prenex_13 .cse6) (fp.leq .cse7 .cse6) (not (fp.geq .cse7 (_ +zero 8 24))))))) (or .cse0 .cse1 (forall ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse16 ((_ to_fp 8 24) RNE 100.0))) (or (fp.leq (let ((.cse12 ((_ to_fp 8 24) RNE 3.0)) (.cse14 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse13 (fp.add RNE (fp.div RNE (fp.mul RNE .cse12 v_prenex_1) .cse14) (fp.div RNE v_prenex_2 .cse14))) (.cse15 (fp.add RNE (fp.div RNE v_prenex_1 .cse14) (fp.div RNE (fp.mul RNE .cse12 v_prenex_2) .cse14)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse12 (fp.add RNE (fp.div RNE (fp.mul RNE .cse12 .cse13) .cse14) (fp.div RNE .cse15 .cse14))) .cse14) (fp.div RNE (fp.add RNE (fp.div RNE .cse13 .cse14) (fp.div RNE (fp.mul RNE .cse12 .cse15) .cse14)) .cse14)))) .cse16) (fp.geq v_prenex_2 (_ +zero 8 24)) (fp.leq v_prenex_2 .cse16))))) (or .cse0 .cse1 (forall ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse17 ((_ to_fp 8 24) RNE 3.0)) (.cse19 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse18 (fp.add RNE (fp.div RNE (fp.mul RNE .cse17 v_prenex_3) .cse19) (fp.div RNE v_prenex_4 .cse19))) (.cse20 (fp.add RNE (fp.div RNE v_prenex_3 .cse19) (fp.div RNE (fp.mul RNE .cse17 v_prenex_4) .cse19)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse17 (fp.add RNE (fp.div RNE (fp.mul RNE .cse17 .cse18) .cse19) (fp.div RNE .cse20 .cse19))) .cse19) (fp.div RNE (fp.add RNE (fp.div RNE .cse18 .cse19) (fp.div RNE (fp.mul RNE .cse17 .cse20) .cse19)) .cse19)))) ((_ to_fp 8 24) RNE 100.0)) (fp.geq v_prenex_4 (_ +zero 8 24))))) (or .cse0 .cse1 (forall ((v_prenex_12 (_ FloatingPoint 8 24)) (v_prenex_11 (_ FloatingPoint 8 24))) (or (fp.geq v_prenex_11 (_ +zero 8 24)) (fp.leq v_prenex_11 ((_ to_fp 8 24) RNE 100.0)) (fp.geq (let ((.cse21 ((_ to_fp 8 24) RNE 3.0)) (.cse23 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse22 (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 v_prenex_12) .cse23) (fp.div RNE v_prenex_11 .cse23))) (.cse24 (fp.add RNE (fp.div RNE v_prenex_12 .cse23) (fp.div RNE (fp.mul RNE .cse21 v_prenex_11) .cse23)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 .cse22) .cse23) (fp.div RNE .cse24 .cse23))) .cse23) (fp.div RNE (fp.add RNE (fp.div RNE .cse22 .cse23) (fp.div RNE (fp.mul RNE .cse21 .cse24) .cse23)) .cse23)))) (_ +zero 8 24))))) (or (forall ((v_main_~x1~0_BEFORE_CALL_39 (_ FloatingPoint 8 24)) (v_main_~y1~0_BEFORE_CALL_43 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_43 (_ +zero 8 24)) (fp.geq (let ((.cse25 ((_ to_fp 8 24) RNE 3.0)) (.cse27 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse26 (fp.add RNE (fp.div RNE (fp.mul RNE .cse25 v_main_~x1~0_BEFORE_CALL_39) .cse27) (fp.div RNE v_main_~y1~0_BEFORE_CALL_43 .cse27))) (.cse28 (fp.add RNE (fp.div RNE v_main_~x1~0_BEFORE_CALL_39 .cse27) (fp.div RNE (fp.mul RNE .cse25 v_main_~y1~0_BEFORE_CALL_43) .cse27)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse25 (fp.add RNE (fp.div RNE (fp.mul RNE .cse25 .cse26) .cse27) (fp.div RNE .cse28 .cse27))) .cse27) (fp.div RNE (fp.add RNE (fp.div RNE .cse26 .cse27) (fp.div RNE (fp.mul RNE .cse25 .cse28) .cse27)) .cse27)))) (_ +zero 8 24)))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_prenex_18 (_ FloatingPoint 8 24)) (v_prenex_17 (_ FloatingPoint 8 24))) (let ((.cse29 (let ((.cse30 ((_ to_fp 8 24) RNE 3.0)) (.cse32 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse31 (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 v_prenex_18) .cse32) (fp.div RNE v_prenex_17 .cse32))) (.cse33 (fp.add RNE (fp.div RNE v_prenex_18 .cse32) (fp.div RNE (fp.mul RNE .cse30 v_prenex_17) .cse32)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 .cse31) .cse32) (fp.div RNE .cse33 .cse32))) .cse32) (fp.div RNE (fp.add RNE (fp.div RNE .cse31 .cse32) (fp.div RNE (fp.mul RNE .cse30 .cse33) .cse32)) .cse32)))))) (or (fp.geq v_prenex_17 (_ +zero 8 24)) (not (fp.leq .cse29 ((_ to_fp 8 24) RNE 100.0))) (fp.geq .cse29 (_ +zero 8 24)))))) (or .cse0 .cse1 (forall ((v_prenex_16 (_ FloatingPoint 8 24)) (v_prenex_15 (_ FloatingPoint 8 24))) (let ((.cse34 (let ((.cse35 ((_ to_fp 8 24) RNE 3.0)) (.cse37 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse36 (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 v_prenex_16) .cse37) (fp.div RNE v_prenex_15 .cse37))) (.cse38 (fp.add RNE (fp.div RNE v_prenex_16 .cse37) (fp.div RNE (fp.mul RNE .cse35 v_prenex_15) .cse37)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 .cse36) .cse37) (fp.div RNE .cse38 .cse37))) .cse37) (fp.div RNE (fp.add RNE (fp.div RNE .cse36 .cse37) (fp.div RNE (fp.mul RNE .cse35 .cse38) .cse37)) .cse37)))))) (or (fp.geq v_prenex_15 (_ +zero 8 24)) (fp.leq .cse34 ((_ to_fp 8 24) RNE 100.0)) (not (fp.geq .cse34 (_ +zero 8 24))))))) (or .cse0 .cse1 (forall ((v_prenex_9 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse39 (let ((.cse41 ((_ to_fp 8 24) RNE 3.0)) (.cse43 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse42 (fp.add RNE (fp.div RNE (fp.mul RNE .cse41 v_prenex_9) .cse43) (fp.div RNE v_prenex_10 .cse43))) (.cse44 (fp.add RNE (fp.div RNE v_prenex_9 .cse43) (fp.div RNE (fp.mul RNE .cse41 v_prenex_10) .cse43)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse41 (fp.add RNE (fp.div RNE (fp.mul RNE .cse41 .cse42) .cse43) (fp.div RNE .cse44 .cse43))) .cse43) (fp.div RNE (fp.add RNE (fp.div RNE .cse42 .cse43) (fp.div RNE (fp.mul RNE .cse41 .cse44) .cse43)) .cse43))))) (.cse40 ((_ to_fp 8 24) RNE 100.0))) (or (fp.geq .cse39 (_ +zero 8 24)) (not (fp.leq .cse39 .cse40)) (fp.leq v_prenex_10 .cse40))))) (or .cse0 .cse1 (forall ((v_prenex_5 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse45 ((_ to_fp 8 24) RNE 100.0))) (or (fp.leq v_prenex_6 .cse45) (fp.leq (let ((.cse46 ((_ to_fp 8 24) RNE 3.0)) (.cse48 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse47 (fp.add RNE (fp.div RNE (fp.mul RNE .cse46 v_prenex_5) .cse48) (fp.div RNE v_prenex_6 .cse48))) (.cse49 (fp.add RNE (fp.div RNE v_prenex_5 .cse48) (fp.div RNE (fp.mul RNE .cse46 v_prenex_6) .cse48)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse46 (fp.add RNE (fp.div RNE (fp.mul RNE .cse46 .cse47) .cse48) (fp.div RNE .cse49 .cse48))) .cse48) (fp.div RNE (fp.add RNE (fp.div RNE .cse47 .cse48) (fp.div RNE (fp.mul RNE .cse46 .cse49) .cse48)) .cse48)))) .cse45))))))) is different from true [2018-09-19 15:55:52,531 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 (forall ((v_prenex_12 (_ FloatingPoint 8 24)) (v_prenex_11 (_ FloatingPoint 8 24))) (or (fp.geq v_prenex_11 (_ +zero 8 24)) (fp.leq v_prenex_11 ((_ to_fp 8 24) RNE 100.0)) (fp.geq (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 v_prenex_12) .cse3) (fp.div RNE v_prenex_11 .cse3))) (.cse4 (fp.add RNE (fp.div RNE v_prenex_12 .cse3) (fp.div RNE (fp.mul RNE .cse1 v_prenex_11) .cse3)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) .cse3)))) (_ +zero 8 24))))) (or .cse0 (forall ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse5 ((_ to_fp 8 24) RNE 3.0)) (.cse7 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse6 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 v_prenex_3) .cse7) (fp.div RNE v_prenex_4 .cse7))) (.cse8 (fp.add RNE (fp.div RNE v_prenex_3 .cse7) (fp.div RNE (fp.mul RNE .cse5 v_prenex_4) .cse7)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 (fp.add RNE (fp.div RNE (fp.mul RNE .cse5 .cse6) .cse7) (fp.div RNE .cse8 .cse7))) .cse7) (fp.div RNE (fp.add RNE (fp.div RNE .cse6 .cse7) (fp.div RNE (fp.mul RNE .cse5 .cse8) .cse7)) .cse7)))) ((_ to_fp 8 24) RNE 100.0)) (fp.geq v_prenex_4 (_ +zero 8 24))))) .cse0 (or .cse0 (forall ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse9 ((_ to_fp 8 24) RNE 3.0)) (.cse11 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse10 (fp.add RNE (fp.div RNE (fp.mul RNE .cse9 v_prenex_7) .cse11) (fp.div RNE v_prenex_8 .cse11))) (.cse12 (fp.add RNE (fp.div RNE v_prenex_7 .cse11) (fp.div RNE (fp.mul RNE .cse9 v_prenex_8) .cse11)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse9 (fp.add RNE (fp.div RNE (fp.mul RNE .cse9 .cse10) .cse11) (fp.div RNE .cse12 .cse11))) .cse11) (fp.div RNE (fp.add RNE (fp.div RNE .cse10 .cse11) (fp.div RNE (fp.mul RNE .cse9 .cse12) .cse11)) .cse11)))) (_ +zero 8 24)) (fp.leq v_prenex_8 ((_ to_fp 8 24) RNE 100.0))))) (or .cse0 (forall ((v_prenex_9 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (let ((.cse13 (let ((.cse15 ((_ to_fp 8 24) RNE 3.0)) (.cse17 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse16 (fp.add RNE (fp.div RNE (fp.mul RNE .cse15 v_prenex_9) .cse17) (fp.div RNE v_prenex_10 .cse17))) (.cse18 (fp.add RNE (fp.div RNE v_prenex_9 .cse17) (fp.div RNE (fp.mul RNE .cse15 v_prenex_10) .cse17)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse15 (fp.add RNE (fp.div RNE (fp.mul RNE .cse15 .cse16) .cse17) (fp.div RNE .cse18 .cse17))) .cse17) (fp.div RNE (fp.add RNE (fp.div RNE .cse16 .cse17) (fp.div RNE (fp.mul RNE .cse15 .cse18) .cse17)) .cse17))))) (.cse14 ((_ to_fp 8 24) RNE 100.0))) (or (fp.geq .cse13 (_ +zero 8 24)) (not (fp.leq .cse13 .cse14)) (fp.leq v_prenex_10 .cse14))))) (or .cse0 (forall ((v_prenex_14 (_ FloatingPoint 8 24)) (v_prenex_13 (_ FloatingPoint 8 24))) (let ((.cse19 ((_ to_fp 8 24) RNE 100.0)) (.cse20 (let ((.cse21 ((_ to_fp 8 24) RNE 3.0)) (.cse23 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse22 (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 v_prenex_14) .cse23) (fp.div RNE v_prenex_13 .cse23))) (.cse24 (fp.add RNE (fp.div RNE v_prenex_14 .cse23) (fp.div RNE (fp.mul RNE .cse21 v_prenex_13) .cse23)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 (fp.add RNE (fp.div RNE (fp.mul RNE .cse21 .cse22) .cse23) (fp.div RNE .cse24 .cse23))) .cse23) (fp.div RNE (fp.add RNE (fp.div RNE .cse22 .cse23) (fp.div RNE (fp.mul RNE .cse21 .cse24) .cse23)) .cse23)))))) (or (fp.leq v_prenex_13 .cse19) (fp.leq .cse20 .cse19) (not (fp.geq .cse20 (_ +zero 8 24))))))) (or .cse0 (forall ((v_prenex_16 (_ FloatingPoint 8 24)) (v_prenex_15 (_ FloatingPoint 8 24))) (let ((.cse25 (let ((.cse26 ((_ to_fp 8 24) RNE 3.0)) (.cse28 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse27 (fp.add RNE (fp.div RNE (fp.mul RNE .cse26 v_prenex_16) .cse28) (fp.div RNE v_prenex_15 .cse28))) (.cse29 (fp.add RNE (fp.div RNE v_prenex_16 .cse28) (fp.div RNE (fp.mul RNE .cse26 v_prenex_15) .cse28)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse26 (fp.add RNE (fp.div RNE (fp.mul RNE .cse26 .cse27) .cse28) (fp.div RNE .cse29 .cse28))) .cse28) (fp.div RNE (fp.add RNE (fp.div RNE .cse27 .cse28) (fp.div RNE (fp.mul RNE .cse26 .cse29) .cse28)) .cse28)))))) (or (fp.geq v_prenex_15 (_ +zero 8 24)) (fp.leq .cse25 ((_ to_fp 8 24) RNE 100.0)) (not (fp.geq .cse25 (_ +zero 8 24))))))) (or (forall ((v_main_~x1~0_BEFORE_CALL_39 (_ FloatingPoint 8 24)) (v_main_~y1~0_BEFORE_CALL_43 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_43 (_ +zero 8 24)) (fp.geq (let ((.cse30 ((_ to_fp 8 24) RNE 3.0)) (.cse32 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse31 (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 v_main_~x1~0_BEFORE_CALL_39) .cse32) (fp.div RNE v_main_~y1~0_BEFORE_CALL_43 .cse32))) (.cse33 (fp.add RNE (fp.div RNE v_main_~x1~0_BEFORE_CALL_39 .cse32) (fp.div RNE (fp.mul RNE .cse30 v_main_~y1~0_BEFORE_CALL_43) .cse32)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 (fp.add RNE (fp.div RNE (fp.mul RNE .cse30 .cse31) .cse32) (fp.div RNE .cse33 .cse32))) .cse32) (fp.div RNE (fp.add RNE (fp.div RNE .cse31 .cse32) (fp.div RNE (fp.mul RNE .cse30 .cse33) .cse32)) .cse32)))) (_ +zero 8 24)))) .cse0) (or .cse0 (forall ((v_prenex_5 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse34 ((_ to_fp 8 24) RNE 100.0))) (or (fp.leq v_prenex_6 .cse34) (fp.leq (let ((.cse35 ((_ to_fp 8 24) RNE 3.0)) (.cse37 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse36 (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 v_prenex_5) .cse37) (fp.div RNE v_prenex_6 .cse37))) (.cse38 (fp.add RNE (fp.div RNE v_prenex_5 .cse37) (fp.div RNE (fp.mul RNE .cse35 v_prenex_6) .cse37)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 (fp.add RNE (fp.div RNE (fp.mul RNE .cse35 .cse36) .cse37) (fp.div RNE .cse38 .cse37))) .cse37) (fp.div RNE (fp.add RNE (fp.div RNE .cse36 .cse37) (fp.div RNE (fp.mul RNE .cse35 .cse38) .cse37)) .cse37)))) .cse34))))) (or .cse0 (forall ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse43 ((_ to_fp 8 24) RNE 100.0))) (or (fp.leq (let ((.cse39 ((_ to_fp 8 24) RNE 3.0)) (.cse41 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse40 (fp.add RNE (fp.div RNE (fp.mul RNE .cse39 v_prenex_1) .cse41) (fp.div RNE v_prenex_2 .cse41))) (.cse42 (fp.add RNE (fp.div RNE v_prenex_1 .cse41) (fp.div RNE (fp.mul RNE .cse39 v_prenex_2) .cse41)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse39 (fp.add RNE (fp.div RNE (fp.mul RNE .cse39 .cse40) .cse41) (fp.div RNE .cse42 .cse41))) .cse41) (fp.div RNE (fp.add RNE (fp.div RNE .cse40 .cse41) (fp.div RNE (fp.mul RNE .cse39 .cse42) .cse41)) .cse41)))) .cse43) (fp.geq v_prenex_2 (_ +zero 8 24)) (fp.leq v_prenex_2 .cse43))))) (or .cse0 (forall ((v_prenex_18 (_ FloatingPoint 8 24)) (v_prenex_17 (_ FloatingPoint 8 24))) (let ((.cse44 (let ((.cse45 ((_ to_fp 8 24) RNE 3.0)) (.cse47 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse46 (fp.add RNE (fp.div RNE (fp.mul RNE .cse45 v_prenex_18) .cse47) (fp.div RNE v_prenex_17 .cse47))) (.cse48 (fp.add RNE (fp.div RNE v_prenex_18 .cse47) (fp.div RNE (fp.mul RNE .cse45 v_prenex_17) .cse47)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse45 (fp.add RNE (fp.div RNE (fp.mul RNE .cse45 .cse46) .cse47) (fp.div RNE .cse48 .cse47))) .cse47) (fp.div RNE (fp.add RNE (fp.div RNE .cse46 .cse47) (fp.div RNE (fp.mul RNE .cse45 .cse48) .cse47)) .cse47)))))) (or (fp.geq v_prenex_17 (_ +zero 8 24)) (not (fp.leq .cse44 ((_ to_fp 8 24) RNE 100.0))) (fp.geq .cse44 (_ +zero 8 24)))))))) is different from true [2018-09-19 15:55:54,676 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 ((_ to_fp 8 24) RNE 12.0)) (.cse4 ((_ to_fp 8 24) RNE 16.0)) (.cse0 (let ((.cse5 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse6 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse5) .cse3) (fp.div RNE .cse6 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE .cse5 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse6) .cse3)) .cse3))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (= (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3)) c_main_~x1~0) (= (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) c_main_~y1~0) (fp.geq .cse0 (_ +zero 8 24))))) is different from false [2018-09-19 15:55:56,816 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse2 ((_ to_fp 8 24) RNE 12.0)) (.cse4 ((_ to_fp 8 24) RNE 16.0)) (.cse0 (let ((.cse5 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) (.cse6 (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)))) (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse5) .cse3) (fp.div RNE .cse6 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE .cse5 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse6) .cse3)) .cse3))))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (= (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3)) c_main_~x1~0) (= (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)) c_main_~y1~0) (fp.geq .cse0 (_ +zero 8 24))))) is different from true [2018-09-19 15:55:58,878 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 12.0)) (.cse6 ((_ to_fp 8 24) RNE 16.0)) (.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse0 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)) .cse3))) (.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse5) .cse3) (fp.div RNE .cse6 .cse3))) (.cse4 (fp.add RNE (fp.div RNE .cse5 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse6) .cse3)))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (= c_main_~x1~0 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3))) (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)))))) is different from false Received shutdown request... [2018-09-19 15:56:00,972 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) RNE 12.0)) (.cse6 ((_ to_fp 8 24) RNE 16.0)) (.cse1 ((_ to_fp 8 24) RNE 3.0)) (.cse3 ((_ to_fp 8 24) RNE 4.0))) (let ((.cse0 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 c_main_~x1~0) .cse3) (fp.div RNE c_main_~y1~0 .cse3))) .cse3) (fp.div RNE (fp.add RNE (fp.div RNE c_main_~x1~0 .cse3) (fp.div RNE (fp.mul RNE .cse1 c_main_~y1~0) .cse3)) .cse3))) (.cse2 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse5) .cse3) (fp.div RNE .cse6 .cse3))) (.cse4 (fp.add RNE (fp.div RNE .cse5 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse6) .cse3)))) (and (fp.leq .cse0 ((_ to_fp 8 24) RNE 100.0)) (= c_main_~x1~0 (fp.add RNE (fp.div RNE (fp.mul RNE .cse1 .cse2) .cse3) (fp.div RNE .cse4 .cse3))) (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 (fp.add RNE (fp.div RNE .cse2 .cse3) (fp.div RNE (fp.mul RNE .cse1 .cse4) .cse3)))))) is different from true [2018-09-19 15:56:00,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 15:56:00,974 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 15:56:00,980 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 15:56:00,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:56:00 BoogieIcfgContainer [2018-09-19 15:56:00,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:56:00,981 INFO L168 Benchmark]: Toolchain (without parser) took 290037.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -230.4 MB). Peak memory consumption was 493.7 MB. Max. memory is 7.1 GB. [2018-09-19 15:56:00,982 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:56:00,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.40 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:56:00,984 INFO L168 Benchmark]: Boogie Preprocessor took 50.10 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:56:00,984 INFO L168 Benchmark]: RCFGBuilder took 2567.26 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:56:00,985 INFO L168 Benchmark]: TraceAbstraction took 287084.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 521.2 MB). Peak memory consumption was 521.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:56:00,991 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 329.40 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 50.10 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 2567.26 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 287084.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 521.2 MB). Peak memory consumption was 521.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (73states) and FLOYD_HOARE automaton (currently 8 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. TIMEOUT Result, 286.9s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 101.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 257 SDtfs, 62 SDslu, 820 SDs, 0 SdLazy, 255 SolverSat, 35 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 52.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 465 SyntacticMatches, 9 SemanticMatches, 108 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 117.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 180.9s InterpolantComputationTime, 304 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 542 ConstructedInterpolants, 3 QuantifiedInterpolants, 850032 SizeOfPredicates, 50 NumberOfNonLiveVariables, 567 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 496/678 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown