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/Float_div_bad_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:54:03,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:54:03,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:54:03,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:54:03,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:54:03,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:54:03,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:54:03,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:54:03,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:54:03,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:54:03,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:54:03,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:54:03,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:54:03,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:54:03,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:54:03,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:54:03,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:54:03,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:54:03,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:54:03,087 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:54:03,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:54:03,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:54:03,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:54:03,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:54:03,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:54:03,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:54:03,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:54:03,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:54:03,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:54:03,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:54:03,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:54:03,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:54:03,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:54:03,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:54:03,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:54:03,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:54:03,102 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:54:03,120 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:54:03,121 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:54:03,122 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:54:03,122 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:54:03,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:54:03,123 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:54:03,123 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:54:03,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:54:03,123 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:54:03,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:54:03,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:54:03,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:54:03,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:54:03,124 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:54:03,124 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:54:03,125 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:54:03,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:54:03,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:54:03,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:54:03,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:54:03,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:54:03,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:54:03,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:54:03,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:54:03,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:54:03,127 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:54:03,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:54:03,127 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:54:03,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:54:03,127 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:54:03,128 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:54:03,128 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:54:03,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:54:03,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:54:03,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:54:03,214 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:54:03,215 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:54:03,215 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad_false-unreach-call.i [2018-09-19 15:54:03,591 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1e88801/2749a0f30b93455ea328aadd3ea071ce/FLAG049dc3961 [2018-09-19 15:54:03,745 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:54:03,746 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad_false-unreach-call.i [2018-09-19 15:54:03,753 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1e88801/2749a0f30b93455ea328aadd3ea071ce/FLAG049dc3961 [2018-09-19 15:54:03,768 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1e88801/2749a0f30b93455ea328aadd3ea071ce [2018-09-19 15:54:03,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:54:03,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:54:03,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:54:03,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:54:03,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:54:03,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:54:03" (1/1) ... [2018-09-19 15:54:03,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e10ba6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:03, skipping insertion in model container [2018-09-19 15:54:03,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:54:03" (1/1) ... [2018-09-19 15:54:03,807 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:54:04,004 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:54:04,026 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:54:04,030 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:54:04,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04 WrapperNode [2018-09-19 15:54:04,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:54:04,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:54:04,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:54:04,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:54:04,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:54:04,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:54:04,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:54:04,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:54:04,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (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:54:04,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:54:04,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:54:04,174 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:54:04,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:54:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:54:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:54:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:54:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:54:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:54:04,702 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:54:04,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:54:04 BoogieIcfgContainer [2018-09-19 15:54:04,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:54:04,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:54:04,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:54:04,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:54:04,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:54:03" (1/3) ... [2018-09-19 15:54:04,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566e6974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:54:04, skipping insertion in model container [2018-09-19 15:54:04,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (2/3) ... [2018-09-19 15:54:04,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566e6974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:54:04, skipping insertion in model container [2018-09-19 15:54:04,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:54:04" (3/3) ... [2018-09-19 15:54:04,712 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad_false-unreach-call.i [2018-09-19 15:54:04,722 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:54:04,731 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:54:04,785 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:54:04,786 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:54:04,786 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:54:04,786 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:54:04,786 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:54:04,786 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:54:04,786 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:54:04,787 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:54:04,787 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:54:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-19 15:54:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-19 15:54:04,814 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:04,815 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:04,818 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:04,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-09-19 15:54:04,829 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:04,830 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) [2018-09-19 15:54:04,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:54:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:54:04,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:04,981 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:54:04,982 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:54:04,996 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:54:04,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:54:05,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:54:05,013 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:54:05,013 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:54:05,016 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-09-19 15:54:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:05,038 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-09-19 15:54:05,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:54:05,040 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-19 15:54:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:05,048 INFO L225 Difference]: With dead ends: 31 [2018-09-19 15:54:05,048 INFO L226 Difference]: Without dead ends: 12 [2018-09-19 15:54:05,052 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:54:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-19 15:54:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-19 15:54:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-19 15:54:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-19 15:54:05,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-19 15:54:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:05,100 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-19 15:54:05,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:54:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-19 15:54:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-19 15:54:05,101 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:05,101 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:05,102 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1861991801, now seen corresponding path program 1 times [2018-09-19 15:54:05,108 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:05,108 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:54:05,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:54:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:54:05,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:05,886 WARN L178 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 15:54:05,899 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:54:05,899 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:54:05,914 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:54:05,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:54:05,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:54:05,918 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:54:05,922 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:54:05,922 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-09-19 15:54:06,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:06,961 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-19 15:54:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:54:07,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-19 15:54:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:07,064 INFO L225 Difference]: With dead ends: 19 [2018-09-19 15:54:07,064 INFO L226 Difference]: Without dead ends: 14 [2018-09-19 15:54:07,065 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:54:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-19 15:54:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-19 15:54:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-19 15:54:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-19 15:54:07,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-09-19 15:54:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:07,071 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-19 15:54:07,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:54:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-19 15:54:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-19 15:54:07,072 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:07,072 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:07,072 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash -661808769, now seen corresponding path program 1 times [2018-09-19 15:54:07,073 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:07,073 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:54:07,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:54:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:54:07,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:08,560 WARN L178 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 15:54:08,589 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:54:08,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:54:13,803 WARN L178 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-09-19 15:54:13,818 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:54:13,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:54:13,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-19 15:54:13,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 15:54:13,833 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 15:54:13,833 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-19 15:54:13,833 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-09-19 15:54:22,650 WARN L178 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 15:54:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:22,942 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-19 15:54:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 15:54:22,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-09-19 15:54:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:22,944 INFO L225 Difference]: With dead ends: 25 [2018-09-19 15:54:22,944 INFO L226 Difference]: Without dead ends: 20 [2018-09-19 15:54:22,945 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-19 15:54:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-19 15:54:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-19 15:54:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-19 15:54:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-19 15:54:22,950 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2018-09-19 15:54:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:22,951 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-19 15:54:22,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 15:54:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-19 15:54:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-19 15:54:22,952 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:22,952 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:22,952 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash -875350895, now seen corresponding path program 2 times [2018-09-19 15:54:22,953 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:22,953 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:54:22,959 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 15:54:23,287 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:54:23,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:54:23,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:25,226 WARN L178 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 15:54:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:54:25,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:54:43,315 WARN L178 SmtUtils]: Spent 4.29 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 15:54:45,393 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE c_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0))))) is different from false [2018-09-19 15:54:48,946 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0))))) is different from false [2018-09-19 15:54:51,063 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0))))) is different from true [2018-09-19 15:54:53,225 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-09-19 15:54:55,359 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:54:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2018-09-19 15:54:55,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:54:55,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-09-19 15:54:55,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 15:54:55,399 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 15:54:55,400 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=105, Unknown=5, NotChecked=66, Total=210 [2018-09-19 15:54:55,401 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 15 states. [2018-09-19 15:54:57,574 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse2 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (or (fp.eq c_main_~x~0 .cse0) (not (fp.eq c_main_~x1~0 c_main_~x~0))) (let ((.cse1 (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse2) .cse2) .cse2))) (or (not (fp.eq (fp.div RNE .cse1 .cse2) .cse1)) (fp.eq .cse1 .cse0))) (= (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse2) c_main_~x1~0))) is different from true [2018-09-19 15:54:59,683 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (or (fp.eq c_main_~x~0 .cse0) (not (fp.eq c_main_~x1~0 c_main_~x~0))) (= c_main_~x1~0 (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse1) .cse1)) (let ((.cse2 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1))) (or (fp.eq .cse2 .cse0) (not (fp.eq (fp.div RNE .cse2 .cse1) .cse2)))))) is different from true [2018-09-19 15:55:01,764 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (= (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse0) .cse0) .cse0) c_main_~x1~0) (let ((.cse1 (fp.div RNE c_main_~x1~0 .cse0))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse1 .cse0) .cse1)))))) is different from true [2018-09-19 15:55:16,711 WARN L178 SmtUtils]: Spent 4.76 s on a formula simplification that was a NOOP. DAG size: 17 [2018-09-19 15:55:28,066 WARN L178 SmtUtils]: Spent 4.62 s on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 15:55:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:55:36,432 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-09-19 15:55:36,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:55:36,432 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2018-09-19 15:55:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:55:36,434 INFO L225 Difference]: With dead ends: 34 [2018-09-19 15:55:36,434 INFO L226 Difference]: Without dead ends: 26 [2018-09-19 15:55:36,435 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=55, Invalid=169, Unknown=10, NotChecked=186, Total=420 [2018-09-19 15:55:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-19 15:55:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-19 15:55:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-19 15:55:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-19 15:55:36,444 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2018-09-19 15:55:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:55:36,444 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-19 15:55:36,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 15:55:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-19 15:55:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-19 15:55:36,446 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:55:36,446 INFO L376 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:55:36,446 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:55:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1788298717, now seen corresponding path program 3 times [2018-09-19 15:55:36,447 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:55:36,447 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:55:36,458 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-09-19 15:55:37,071 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-09-19 15:55:37,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:55:37,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:55:38,789 WARN L178 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 15:55:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:55:38,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:55:52,964 WARN L178 SmtUtils]: Spent 2.76 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 15:55:55,041 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE c_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0))))) is different from false [2018-09-19 15:55:57,112 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE c_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0))))) is different from true [2018-09-19 15:55:59,235 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0))))) is different from false [2018-09-19 15:56:01,341 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0))))) is different from true [2018-09-19 15:56:03,475 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-09-19 15:56:05,623 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:56:07,795 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-09-19 15:56:09,959 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:56:12,155 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-09-19 15:56:14,361 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:56:16,596 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-09-19 15:56:18,826 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:56:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 54 not checked. [2018-09-19 15:56:18,861 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:56:18,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-09-19 15:56:18,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-19 15:56:18,862 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-19 15:56:18,863 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=173, Unknown=12, NotChecked=186, Total=420 [2018-09-19 15:56:18,863 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 21 states. [2018-09-19 15:56:21,137 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse2 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (or (fp.eq c_main_~x~0 .cse0) (not (fp.eq c_main_~x1~0 c_main_~x~0))) (let ((.cse1 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse2) .cse2) .cse2) .cse2) .cse2) .cse2))) (or (not (fp.eq (fp.div RNE .cse1 .cse2) .cse1)) (fp.eq .cse1 .cse0))) (= (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse2) c_main_~x1~0))) is different from true [2018-09-19 15:56:23,345 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv0 32))) (.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (or (fp.eq c_main_~x~0 .cse0) (not (fp.eq c_main_~x1~0 c_main_~x~0))) (= c_main_~x1~0 (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse1) .cse1)) (let ((.cse2 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse2 .cse1) .cse2)) (fp.eq .cse2 .cse0))))) is different from true [2018-09-19 15:56:25,527 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div RNE .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (= (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse1) .cse1) .cse1) c_main_~x1~0))) is different from true [2018-09-19 15:56:27,680 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse0) .cse0) .cse0))) (or (not (fp.eq (fp.div RNE .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from true [2018-09-19 15:56:29,796 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse0) .cse0))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse1 .cse0) .cse1)))))) is different from true [2018-09-19 15:56:31,873 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div RNE c_main_~x1~0 .cse0))) (or (fp.eq .cse1 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (fp.eq (fp.div RNE .cse1 .cse0) .cse1)))))) is different from true [2018-09-19 15:56:47,398 WARN L178 SmtUtils]: Spent 4.40 s on a formula simplification that was a NOOP. DAG size: 17 [2018-09-19 15:57:02,361 WARN L178 SmtUtils]: Spent 7.13 s on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 15:57:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:57:09,035 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-09-19 15:57:09,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 15:57:09,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2018-09-19 15:57:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:57:09,038 INFO L225 Difference]: With dead ends: 40 [2018-09-19 15:57:09,038 INFO L226 Difference]: Without dead ends: 32 [2018-09-19 15:57:09,040 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.1s TimeCoverageRelationStatistics Valid=76, Invalid=259, Unknown=19, NotChecked=516, Total=870 [2018-09-19 15:57:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-19 15:57:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-19 15:57:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-19 15:57:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-19 15:57:09,050 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 25 [2018-09-19 15:57:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:57:09,050 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-19 15:57:09,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-19 15:57:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-19 15:57:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-19 15:57:09,052 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:57:09,052 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:57:09,052 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:57:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash -481015243, now seen corresponding path program 4 times [2018-09-19 15:57:09,053 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:57:09,053 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:57:09,061 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-19 15:57:09,754 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-19 15:57:09,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:57:09,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:57:11,271 WARN L178 SmtUtils]: Spent 749.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-19 15:57:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:57:11,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:57:21,305 WARN L178 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-09-19 15:57:23,382 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE c_main_~x1~0 .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:57:26,063 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:57:28,167 WARN L819 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from true [2018-09-19 15:57:30,302 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:57:33,216 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:57:37,406 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:57:41,510 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:57:43,747 WARN L819 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from true [2018-09-19 15:57:46,054 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:57:48,338 WARN L819 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from true [2018-09-19 15:57:50,657 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:57:52,953 WARN L819 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from true [2018-09-19 15:57:55,294 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:57:57,624 WARN L819 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from true [2018-09-19 15:57:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 108 not checked. [2018-09-19 15:57:57,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:57:57,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-09-19 15:57:57,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-19 15:57:57,660 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-19 15:57:57,660 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=175, Unknown=14, NotChecked=306, Total=552 [2018-09-19 15:57:57,661 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 24 states. [2018-09-19 15:58:00,190 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0))) (not (fp.eq c_main_~x1~0 c_main_~x~0)) (= (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse1) c_main_~x1~0))) is different from true [2018-09-19 15:58:02,509 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse0) .cse0)) (not (fp.eq c_main_~x1~0 c_main_~x~0)) (not (let ((.cse1 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div RNE .cse1 .cse0) .cse1))))) is different from true [2018-09-19 15:58:04,790 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (= (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse0) .cse0) .cse0) c_main_~x1~0) (not (let ((.cse1 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div RNE .cse1 .cse0) .cse1))))) is different from true [2018-09-19 15:58:07,044 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div RNE .cse1 .cse0) .cse1))))) is different from true [2018-09-19 15:58:09,260 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse1) .cse1) .cse1) .cse1) .cse1)))) is different from true [2018-09-19 15:58:11,452 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) is different from true [2018-09-19 15:58:13,614 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) is different from true [2018-09-19 15:58:15,722 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse0) .cse0))) (fp.eq (fp.div RNE .cse1 .cse0) .cse1))))) is different from true [2018-09-19 15:58:19,166 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE ((_ to_fp 8 24) RNE 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div RNE c_main_~x1~0 .cse0))) (fp.eq (fp.div RNE .cse1 .cse0) .cse1))))) is different from true [2018-09-19 15:58:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:58:28,597 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-09-19 15:58:28,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 15:58:28,677 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-09-19 15:58:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:58:28,678 INFO L225 Difference]: With dead ends: 41 [2018-09-19 15:58:28,678 INFO L226 Difference]: Without dead ends: 36 [2018-09-19 15:58:28,679 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.1s TimeCoverageRelationStatistics Valid=80, Invalid=209, Unknown=23, NotChecked=810, Total=1122 [2018-09-19 15:58:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-19 15:58:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-19 15:58:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-19 15:58:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-19 15:58:28,690 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2018-09-19 15:58:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:58:28,691 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-19 15:58:28,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-19 15:58:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-19 15:58:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-19 15:58:28,692 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:58:28,693 INFO L376 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:58:28,693 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:58:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1822710465, now seen corresponding path program 5 times [2018-09-19 15:58:28,694 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:58:28,694 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:58:28,698 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-09-19 15:58:30,160 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-09-19 15:58:30,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:58:30,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:58:32,613 WARN L178 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 23 [2018-09-19 15:58:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:58:32,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:58:44,186 WARN L178 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 7 [2018-09-19 15:58:46,261 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE c_main_~x1~0 .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:58:48,848 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:58:53,005 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false Received shutdown request... [2018-09-19 15:58:56,818 WARN L797 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from false [2018-09-19 15:58:58,989 WARN L819 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 8 24) RNE (/ 8.0 5.0)))) (let ((.cse0 (fp.div RNE (fp.div RNE (fp.div RNE (fp.div RNE c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div RNE .cse0 .cse1) .cse0)))) is different from true [2018-09-19 15:58:58,991 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-19 15:58:59,192 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2018-09-19 15:58:59,193 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 15:58:59,198 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 15:58:59,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:58:59 BoogieIcfgContainer [2018-09-19 15:58:59,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:58:59,199 INFO L168 Benchmark]: Toolchain (without parser) took 295420.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -458.9 MB). Peak memory consumption was 283.5 MB. Max. memory is 7.1 GB. [2018-09-19 15:58:59,201 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:58:59,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.55 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:58:59,202 INFO L168 Benchmark]: Boogie Preprocessor took 54.16 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:58:59,203 INFO L168 Benchmark]: RCFGBuilder took 601.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-09-19 15:58:59,204 INFO L168 Benchmark]: TraceAbstraction took 294494.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 322.1 MB). Peak memory consumption was 322.1 MB. Max. memory is 7.1 GB. [2018-09-19 15:58:59,208 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 263.55 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 54.16 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 601.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 294494.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 322.1 MB). Peak memory consumption was 322.1 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 13, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 2 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. TIMEOUT Result, 294.4s OverallTime, 7 OverallIterations, 13 TraceHistogramMax, 132.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 92 SDtfs, 8 SDslu, 288 SDs, 0 SdLazy, 145 SolverSat, 14 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 33.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 123 SyntacticMatches, 10 SemanticMatches, 86 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 225.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=6, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 129.0s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 100089 SizeOfPredicates, 30 NumberOfNonLiveVariables, 207 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 0/376 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown