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/floats-esbmc-regression/digits_for_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:53:07,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:53:07,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:53:07,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:53:07,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:53:07,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:53:07,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:53:07,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:53:07,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:53:07,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:53:07,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:53:07,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:53:07,481 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:53:07,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:53:07,483 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:53:07,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:53:07,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:53:07,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:53:07,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:53:07,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:53:07,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:53:07,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:53:07,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:53:07,496 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:53:07,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:53:07,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:53:07,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:53:07,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:53:07,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:53:07,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:53:07,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:53:07,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:53:07,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:53:07,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:53:07,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:53:07,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:53:07,505 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:53:07,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:53:07,521 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:53:07,522 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:53:07,522 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:53:07,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:53:07,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:53:07,523 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:53:07,524 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:53:07,524 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:53:07,524 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:53:07,524 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:53:07,525 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:53:07,525 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:53:07,525 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:53:07,525 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:53:07,526 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:53:07,526 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:53:07,526 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:53:07,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:53:07,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:53:07,527 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:53:07,527 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:53:07,527 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:53:07,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:53:07,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:53:07,528 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:53:07,528 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:53:07,528 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:53:07,528 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:53:07,528 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:53:07,529 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:53:07,529 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:53:07,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:53:07,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:53:07,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:53:07,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:53:07,601 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:53:07,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/digits_for_true-unreach-call.i [2018-09-19 15:53:07,975 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/352cbbd9d/1d966b61633b4d4893424380f32d6e69/FLAG384bf4249 [2018-09-19 15:53:08,160 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:53:08,161 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/digits_for_true-unreach-call.i [2018-09-19 15:53:08,167 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/352cbbd9d/1d966b61633b4d4893424380f32d6e69/FLAG384bf4249 [2018-09-19 15:53:08,181 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/352cbbd9d/1d966b61633b4d4893424380f32d6e69 [2018-09-19 15:53:08,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:53:08,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:53:08,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:53:08,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:53:08,204 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:53:08,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:53:08" (1/1) ... [2018-09-19 15:53:08,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac9293f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08, skipping insertion in model container [2018-09-19 15:53:08,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:53:08" (1/1) ... [2018-09-19 15:53:08,222 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:53:08,457 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:53:08,480 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:53:08,506 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:53:08,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08 WrapperNode [2018-09-19 15:53:08,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:53:08,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:53:08,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:53:08,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:53:08,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08" (1/1) ... [2018-09-19 15:53:08,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08" (1/1) ... [2018-09-19 15:53:08,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08" (1/1) ... [2018-09-19 15:53:08,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08" (1/1) ... [2018-09-19 15:53:08,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08" (1/1) ... [2018-09-19 15:53:08,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08" (1/1) ... [2018-09-19 15:53:08,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08" (1/1) ... [2018-09-19 15:53:08,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:53:08,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:53:08,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:53:08,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:53:08,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08" (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:53:08,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:53:08,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:53:08,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:53:08,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:53:08,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:53:08,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:53:08,632 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:53:08,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:53:08,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:53:11,008 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:53:11,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:53:11 BoogieIcfgContainer [2018-09-19 15:53:11,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:53:11,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:53:11,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:53:11,021 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:53:11,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:53:08" (1/3) ... [2018-09-19 15:53:11,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296609e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:53:11, skipping insertion in model container [2018-09-19 15:53:11,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:08" (2/3) ... [2018-09-19 15:53:11,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296609e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:53:11, skipping insertion in model container [2018-09-19 15:53:11,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:53:11" (3/3) ... [2018-09-19 15:53:11,028 INFO L112 eAbstractionObserver]: Analyzing ICFG digits_for_true-unreach-call.i [2018-09-19 15:53:11,065 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:53:11,087 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:53:11,162 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:53:11,163 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:53:11,163 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:53:11,164 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:53:11,164 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:53:11,164 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:53:11,164 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:53:11,164 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:53:11,165 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:53:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-19 15:53:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-19 15:53:11,189 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:53:11,190 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:53:11,192 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:53:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash 563245249, now seen corresponding path program 1 times [2018-09-19 15:53:11,200 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:53:11,201 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:53:11,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:53:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:53:11,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:11,297 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:53:11,297 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:53:11,312 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:53:11,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:53:11,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:53:11,328 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:53:11,329 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:53:11,332 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-09-19 15:53:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:53:11,359 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-09-19 15:53:11,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:53:11,361 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-19 15:53:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:53:11,371 INFO L225 Difference]: With dead ends: 32 [2018-09-19 15:53:11,372 INFO L226 Difference]: Without dead ends: 13 [2018-09-19 15:53:11,376 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:53:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-19 15:53:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-19 15:53:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-19 15:53:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-19 15:53:11,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-19 15:53:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:53:11,412 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-19 15:53:11,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:53:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-19 15:53:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-19 15:53:11,413 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:53:11,413 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:53:11,413 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:53:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash -496423, now seen corresponding path program 1 times [2018-09-19 15:53:11,414 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:53:11,414 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:53:11,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:53:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:53:11,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:11,479 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:53:11,479 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:53:11,491 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:53:11,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:53:11,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:53:11,493 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:53:11,494 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:53:11,494 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-09-19 15:53:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:53:13,804 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-19 15:53:13,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:53:13,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-19 15:53:13,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:53:13,806 INFO L225 Difference]: With dead ends: 20 [2018-09-19 15:53:13,807 INFO L226 Difference]: Without dead ends: 15 [2018-09-19 15:53:13,808 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 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:53:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-19 15:53:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-19 15:53:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-19 15:53:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-19 15:53:13,813 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-09-19 15:53:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:53:13,814 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-19 15:53:13,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:53:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-19 15:53:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-19 15:53:13,815 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:53:13,815 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:53:13,815 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:53:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1177044387, now seen corresponding path program 1 times [2018-09-19 15:53:13,816 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:53:13,816 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:53:13,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:53:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:53:14,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:53:14,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:53:16,758 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:53:18,827 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:53:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-19 15:53:18,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:53:18,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-19 15:53:18,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 15:53:18,862 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 15:53:18,862 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=11, Unknown=2, NotChecked=6, Total=30 [2018-09-19 15:53:18,862 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-09-19 15:53:20,968 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:53:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:53:23,263 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-19 15:53:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 15:53:23,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-09-19 15:53:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:53:23,265 INFO L225 Difference]: With dead ends: 23 [2018-09-19 15:53:23,266 INFO L226 Difference]: Without dead ends: 18 [2018-09-19 15:53:23,266 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2018-09-19 15:53:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-19 15:53:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-19 15:53:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-19 15:53:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-19 15:53:23,272 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-09-19 15:53:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:53:23,272 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-19 15:53:23,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 15:53:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-19 15:53:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-19 15:53:23,273 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:53:23,273 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:53:23,274 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:53:23,274 INFO L82 PathProgramCache]: Analyzing trace with hash -489337255, now seen corresponding path program 2 times [2018-09-19 15:53:23,274 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:53:23,275 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:53:23,288 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 15:53:24,572 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:53:24,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:53:24,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:53:24,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:53:27,020 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:53:29,093 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:53:31,263 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:53:33,410 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:53:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-09-19 15:53:33,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:53:33,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-09-19 15:53:33,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 15:53:33,485 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 15:53:33,485 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=18, Unknown=4, NotChecked=18, Total=56 [2018-09-19 15:53:33,486 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 8 states. [2018-09-19 15:53:35,712 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:53:37,795 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:53:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:53:40,094 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-19 15:53:40,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 15:53:40,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-09-19 15:53:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:53:40,096 INFO L225 Difference]: With dead ends: 26 [2018-09-19 15:53:40,096 INFO L226 Difference]: Without dead ends: 21 [2018-09-19 15:53:40,097 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=20, Invalid=20, Unknown=6, NotChecked=44, Total=90 [2018-09-19 15:53:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-19 15:53:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-19 15:53:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-19 15:53:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-19 15:53:40,103 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-09-19 15:53:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:53:40,103 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-19 15:53:40,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 15:53:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-19 15:53:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-19 15:53:40,105 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:53:40,105 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:53:40,105 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:53:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash -169763, now seen corresponding path program 3 times [2018-09-19 15:53:40,106 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:53:40,106 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:53:40,111 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-09-19 15:53:42,124 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-19 15:53:42,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:53:42,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:53:42,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:53:44,672 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:53:46,738 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:53:48,888 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:53:51,034 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:53:53,260 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:53:55,477 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:53:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-09-19 15:53:55,565 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:53:55,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-09-19 15:53:55,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 15:53:55,566 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 15:53:55,567 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=27, Unknown=6, NotChecked=36, Total=90 [2018-09-19 15:53:55,567 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 10 states. [2018-09-19 15:53:57,835 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:54:00,015 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:54:02,096 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:54:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:12,649 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-19 15:54:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 15:54:12,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-09-19 15:54:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:12,746 INFO L225 Difference]: With dead ends: 29 [2018-09-19 15:54:12,746 INFO L226 Difference]: Without dead ends: 24 [2018-09-19 15:54:12,747 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=27, Invalid=30, Unknown=9, NotChecked=90, Total=156 [2018-09-19 15:54:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-19 15:54:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-19 15:54:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-19 15:54:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-19 15:54:12,754 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-09-19 15:54:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:12,754 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-19 15:54:12,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 15:54:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-19 15:54:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-19 15:54:12,755 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:12,756 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:12,756 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash -35450919, now seen corresponding path program 4 times [2018-09-19 15:54:12,757 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:12,757 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:54:12,764 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-19 15:54:15,348 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-19 15:54:15,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:54:15,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:54:15,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:54:18,040 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:54:20,111 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:22,284 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:54:24,447 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:26,707 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:54:28,939 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:31,251 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:54:33,558 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2018-09-19 15:54:33,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:54:33,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-19 15:54:33,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 15:54:33,637 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 15:54:33,637 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=38, Unknown=8, NotChecked=60, Total=132 [2018-09-19 15:54:33,637 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 12 states. [2018-09-19 15:54:35,974 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:54:38,219 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:54:40,385 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:54:42,478 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:54:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:53,617 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-19 15:54:53,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 15:54:53,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-09-19 15:54:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:53,727 INFO L225 Difference]: With dead ends: 32 [2018-09-19 15:54:53,727 INFO L226 Difference]: Without dead ends: 27 [2018-09-19 15:54:53,728 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=34, Invalid=42, Unknown=12, NotChecked=152, Total=240 [2018-09-19 15:54:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-19 15:54:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-19 15:54:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-19 15:54:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-19 15:54:53,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-09-19 15:54:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:53,736 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-19 15:54:53,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 15:54:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-19 15:54:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-19 15:54:53,737 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:53,738 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:53,738 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1170618205, now seen corresponding path program 5 times [2018-09-19 15:54:53,739 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:53,739 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) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 15:54:53,744 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-09-19 15:54:59,159 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-19 15:54:59,159 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:54:59,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:54:59,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:55:01,882 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:55:03,955 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:55:06,114 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:55:08,274 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:55:10,540 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) .cse3)) (fp.eq c_main_~x~0 .cse3))) is different from false [2018-09-19 15:55:12,774 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) .cse3)) (fp.eq c_main_~x~0 .cse3))) is different from true [2018-09-19 15:55:15,111 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from false [2018-09-19 15:55:17,430 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from true [2018-09-19 15:55:19,849 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5)))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from false [2018-09-19 15:55:22,267 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5)))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from true [2018-09-19 15:55:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 40 not checked. [2018-09-19 15:55:22,396 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:55:22,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-19 15:55:22,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 15:55:22,397 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 15:55:22,398 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=51, Unknown=10, NotChecked=90, Total=182 [2018-09-19 15:55:22,398 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-09-19 15:55:24,819 WARN L819 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5)))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:55:27,185 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4))) (= (let ((.cse5 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) c_main_~x~0))) is different from true [2018-09-19 15:55:29,466 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (let ((.cse5 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))) .cse5)) (fp.eq c_main_~x~0 .cse5))))) is different from true [2018-09-19 15:55:31,657 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:55:33,762 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:55:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:55:44,548 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-19 15:55:44,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 15:55:44,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-19 15:55:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:55:44,665 INFO L225 Difference]: With dead ends: 35 [2018-09-19 15:55:44,665 INFO L226 Difference]: Without dead ends: 30 [2018-09-19 15:55:44,666 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=41, Invalid=56, Unknown=15, NotChecked=230, Total=342 [2018-09-19 15:55:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-19 15:55:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-19 15:55:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-19 15:55:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-19 15:55:44,674 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-09-19 15:55:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:55:44,675 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-19 15:55:44,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 15:55:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-19 15:55:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-19 15:55:44,677 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:55:44,677 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:55:44,677 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:55:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash -520507047, now seen corresponding path program 6 times [2018-09-19 15:55:44,678 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:55:44,678 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:55:44,682 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-09-19 15:55:49,448 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-19 15:55:49,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:55:49,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:55:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:55:50,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:55:52,398 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:55:54,471 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:55:56,642 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:55:58,820 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:56:01,070 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:56:03,340 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:56:05,683 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:56:08,031 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:56:10,461 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:56:12,889 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:56:15,406 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:56:17,897 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:56:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 57 not checked. [2018-09-19 15:56:18,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:56:18,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-09-19 15:56:18,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-19 15:56:18,023 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-19 15:56:18,023 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=66, Unknown=12, NotChecked=126, Total=240 [2018-09-19 15:56:18,024 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2018-09-19 15:56:20,526 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:56:23,002 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= (let ((.cse5 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) c_main_~x~0))) is different from true [2018-09-19 15:56:25,382 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) c_main_~x~0))) is different from true [2018-09-19 15:56:27,684 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:56:29,872 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:56:31,967 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= c_main_~x~0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse5 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse1 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse1)))))))) is different from true [2018-09-19 15:56:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:56:44,906 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-19 15:56:45,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-19 15:56:45,029 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-09-19 15:56:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:56:45,030 INFO L225 Difference]: With dead ends: 38 [2018-09-19 15:56:45,030 INFO L226 Difference]: Without dead ends: 33 [2018-09-19 15:56:45,031 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=48, Invalid=72, Unknown=18, NotChecked=324, Total=462 [2018-09-19 15:56:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-19 15:56:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-19 15:56:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-19 15:56:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-19 15:56:45,041 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-09-19 15:56:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:56:45,042 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-19 15:56:45,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-19 15:56:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-19 15:56:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-19 15:56:45,043 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:56:45,043 INFO L376 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:56:45,044 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:56:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash -866507299, now seen corresponding path program 7 times [2018-09-19 15:56:45,044 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:56:45,045 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) [2018-09-19 15:56:45,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 15:56:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:56:50,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:56:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:56:50,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:56:52,762 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:56:54,845 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:56:57,018 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:56:59,200 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:57:01,453 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:57:03,717 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:57:06,055 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:57:08,399 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:57:10,826 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:57:13,253 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:57:15,791 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:57:18,341 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:57:20,960 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:57:23,612 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:57:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 77 not checked. [2018-09-19 15:57:23,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:57:23,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-09-19 15:57:23,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-19 15:57:23,753 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-19 15:57:23,754 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=83, Unknown=14, NotChecked=168, Total=306 [2018-09-19 15:57:23,754 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-19 15:57:26,399 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:57:28,924 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:57:31,456 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) c_main_~x~0))) is different from true [2018-09-19 15:57:33,852 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) c_main_~x~0))) is different from true [2018-09-19 15:57:36,126 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:57:38,324 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= c_main_~x~0 (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) (not (fp.eq (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:57:40,431 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:57:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:57:48,987 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-19 15:57:49,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 15:57:49,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-19 15:57:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:57:49,088 INFO L225 Difference]: With dead ends: 41 [2018-09-19 15:57:49,089 INFO L226 Difference]: Without dead ends: 36 [2018-09-19 15:57:49,089 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=55, Invalid=90, Unknown=21, NotChecked=434, Total=600 [2018-09-19 15:57:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-19 15:57:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-19 15:57:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-19 15:57:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-19 15:57:49,102 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-09-19 15:57:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:57:49,102 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-19 15:57:49,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-19 15:57:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-19 15:57:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-19 15:57:49,103 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:57:49,104 INFO L376 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:57:49,104 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:57:49,104 INFO L82 PathProgramCache]: Analyzing trace with hash -638504231, now seen corresponding path program 8 times [2018-09-19 15:57:49,105 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:57:49,105 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:57:49,113 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:57:54,494 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:57:54,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:57:55,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:57:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:57:55,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:57:57,666 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false Received shutdown request... [2018-09-19 15:57:59,745 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:57:59,747 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-19 15:57:59,948 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2018-09-19 15:57:59,948 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 15:57:59,954 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 15:57:59,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:57:59 BoogieIcfgContainer [2018-09-19 15:57:59,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:57:59,956 INFO L168 Benchmark]: Toolchain (without parser) took 291762.16 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -367.0 MB). Peak memory consumption was 361.3 MB. Max. memory is 7.1 GB. [2018-09-19 15:57:59,957 INFO L168 Benchmark]: CDTParser took 0.21 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:57:59,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.50 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:57:59,959 INFO L168 Benchmark]: Boogie Preprocessor took 40.21 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:57:59,959 INFO L168 Benchmark]: RCFGBuilder took 2440.27 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -779.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-09-19 15:57:59,960 INFO L168 Benchmark]: TraceAbstraction took 288943.88 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 401.6 MB). Peak memory consumption was 401.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:57:59,964 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.21 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 331.50 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 40.21 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 2440.27 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -779.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 288943.88 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 401.6 MB). Peak memory consumption was 401.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 9, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 288.8s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 125.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 0 SDslu, 282 SDs, 0 SdLazy, 62 SolverSat, 7 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 60.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 248 SyntacticMatches, 15 SemanticMatches, 99 ConstructedPredicates, 56 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 191.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=9, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 21.2s SatisfiabilityAnalysisTime, 130.5s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 1428859 SizeOfPredicates, 8 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/448 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown