java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 15:44:37,709 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 15:44:37,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 15:44:37,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 15:44:37,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 15:44:37,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 15:44:37,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 15:44:37,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 15:44:37,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 15:44:37,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 15:44:37,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 15:44:37,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 15:44:37,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 15:44:37,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 15:44:37,749 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 15:44:37,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 15:44:37,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 15:44:37,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 15:44:37,766 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 15:44:37,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 15:44:37,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 15:44:37,770 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 15:44:37,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 15:44:37,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 15:44:37,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 15:44:37,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 15:44:37,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 15:44:37,775 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 15:44:37,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 15:44:37,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 15:44:37,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 15:44:37,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 15:44:37,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 15:44:37,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 15:44:37,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 15:44:37,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 15:44:37,780 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-22 15:44:37,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 15:44:37,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 15:44:37,795 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 15:44:37,795 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-22 15:44:37,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-22 15:44:37,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-22 15:44:37,796 INFO L133 SettingsManager]: * Use SBE=true [2018-10-22 15:44:37,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 15:44:37,797 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 15:44:37,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 15:44:37,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 15:44:37,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 15:44:37,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 15:44:37,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 15:44:37,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 15:44:37,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 15:44:37,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 15:44:37,798 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 15:44:37,798 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 15:44:37,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:44:37,799 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 15:44:37,799 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 15:44:37,799 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 15:44:37,799 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-22 15:44:37,799 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 15:44:37,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 15:44:37,800 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 15:44:37,800 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 15:44:37,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 15:44:37,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 15:44:37,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 15:44:37,872 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 15:44:37,873 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 15:44:37,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-22 15:44:37,936 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8c2f041e1/13a92bf4c99d46ab843b5d1419da87ff/FLAGb5bfb5cc7 [2018-10-22 15:44:38,418 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 15:44:38,419 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-22 15:44:38,426 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8c2f041e1/13a92bf4c99d46ab843b5d1419da87ff/FLAGb5bfb5cc7 [2018-10-22 15:44:38,441 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8c2f041e1/13a92bf4c99d46ab843b5d1419da87ff [2018-10-22 15:44:38,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 15:44:38,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 15:44:38,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 15:44:38,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 15:44:38,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 15:44:38,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3236d4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38, skipping insertion in model container [2018-10-22 15:44:38,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 15:44:38,492 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 15:44:38,659 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:44:38,663 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 15:44:38,687 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:44:38,703 INFO L193 MainTranslator]: Completed translation [2018-10-22 15:44:38,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38 WrapperNode [2018-10-22 15:44:38,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 15:44:38,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 15:44:38,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 15:44:38,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 15:44:38,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 15:44:38,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 15:44:38,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 15:44:38,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 15:44:38,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... [2018-10-22 15:44:38,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 15:44:38,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 15:44:38,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 15:44:38,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 15:44:38,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:44:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 15:44:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 15:44:39,327 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 15:44:39,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:44:39 BoogieIcfgContainer [2018-10-22 15:44:39,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 15:44:39,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 15:44:39,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 15:44:39,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 15:44:39,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 03:44:38" (1/3) ... [2018-10-22 15:44:39,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0dbdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:44:39, skipping insertion in model container [2018-10-22 15:44:39,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:44:38" (2/3) ... [2018-10-22 15:44:39,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0dbdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:44:39, skipping insertion in model container [2018-10-22 15:44:39,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:44:39" (3/3) ... [2018-10-22 15:44:39,336 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-10-22 15:44:39,349 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 15:44:39,358 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 15:44:39,385 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 15:44:39,419 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 15:44:39,420 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 15:44:39,420 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 15:44:39,420 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 15:44:39,420 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 15:44:39,420 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 15:44:39,420 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 15:44:39,420 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 15:44:39,421 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 15:44:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-22 15:44:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-22 15:44:39,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:44:39,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-22 15:44:39,446 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:44:39,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:44:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash 891630823, now seen corresponding path program 1 times [2018-10-22 15:44:39,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:44:39,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:44:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:39,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:44:39,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:44:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:44:39,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:44:39,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 15:44:39,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 15:44:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 15:44:39,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 15:44:39,579 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-10-22 15:44:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:44:39,597 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-22 15:44:39,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 15:44:39,599 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2018-10-22 15:44:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:44:39,610 INFO L225 Difference]: With dead ends: 30 [2018-10-22 15:44:39,610 INFO L226 Difference]: Without dead ends: 18 [2018-10-22 15:44:39,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-22 15:44:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-22 15:44:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-22 15:44:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-22 15:44:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-10-22 15:44:39,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 6 [2018-10-22 15:44:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:44:39,652 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-10-22 15:44:39,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 15:44:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2018-10-22 15:44:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-22 15:44:39,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:44:39,653 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:44:39,654 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:44:39,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:44:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1805983239, now seen corresponding path program 1 times [2018-10-22 15:44:39,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:44:39,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:44:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:39,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:44:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:44:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:44:39,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:44:39,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:44:39,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:44:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:44:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:44:39,839 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 3 states. [2018-10-22 15:44:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:44:40,177 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2018-10-22 15:44:40,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:44:40,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-22 15:44:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:44:40,181 INFO L225 Difference]: With dead ends: 25 [2018-10-22 15:44:40,181 INFO L226 Difference]: Without dead ends: 21 [2018-10-22 15:44:40,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:44:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-22 15:44:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-10-22 15:44:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-22 15:44:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-10-22 15:44:40,191 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 7 [2018-10-22 15:44:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:44:40,192 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-10-22 15:44:40,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:44:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2018-10-22 15:44:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 15:44:40,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:44:40,194 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:44:40,194 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:44:40,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:44:40,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1155156665, now seen corresponding path program 1 times [2018-10-22 15:44:40,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:44:40,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:44:40,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:40,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:44:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:44:42,309 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse1 (= c_ULTIMATE.start_main_~y~0 .cse3))) (and (or (<= .cse0 c_ULTIMATE.start_main_~y~0) .cse1 (not (= (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse2 (- 2)) 4294967296)) .cse3 2) c_ULTIMATE.start_main_~y~0))) (or (not (= (+ .cse3 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse2) 4294967296))) c_ULTIMATE.start_main_~y~0)) (and (< c_ULTIMATE.start_main_~y~0 .cse0) (not .cse1))))))) is different from false [2018-10-22 15:44:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:44:42,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:44:42,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:44:42,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:44:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:44:42,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-22 15:44:42,340 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 3 states. [2018-10-22 15:44:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:44:42,347 INFO L93 Difference]: Finished difference Result 40 states and 64 transitions. [2018-10-22 15:44:42,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:44:42,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-22 15:44:42,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:44:42,351 INFO L225 Difference]: With dead ends: 40 [2018-10-22 15:44:42,351 INFO L226 Difference]: Without dead ends: 24 [2018-10-22 15:44:42,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-22 15:44:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-22 15:44:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-22 15:44:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-22 15:44:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-10-22 15:44:42,359 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 19 [2018-10-22 15:44:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:44:42,359 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-10-22 15:44:42,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:44:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-22 15:44:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 15:44:42,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:44:42,361 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:44:42,361 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:44:42,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:44:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash -454092087, now seen corresponding path program 1 times [2018-10-22 15:44:42,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:44:42,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:44:42,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:42,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:44:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:44:44,443 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse1 (= c_ULTIMATE.start_main_~y~0 .cse3))) (and (or (<= .cse0 c_ULTIMATE.start_main_~y~0) .cse1 (not (= (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse2 (- 2)) 4294967296)) .cse3 2) c_ULTIMATE.start_main_~y~0))) (or (not (= (+ .cse3 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse2) 4294967296))) c_ULTIMATE.start_main_~y~0)) (and (< c_ULTIMATE.start_main_~y~0 .cse0) (not .cse1))))))) is different from false [2018-10-22 15:44:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:44:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:44:44,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:44:44,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:44:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:44:44,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-22 15:44:44,449 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 3 states. [2018-10-22 15:44:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:44:44,453 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2018-10-22 15:44:44,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:44:44,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-22 15:44:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:44:44,455 INFO L225 Difference]: With dead ends: 45 [2018-10-22 15:44:44,455 INFO L226 Difference]: Without dead ends: 25 [2018-10-22 15:44:44,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-22 15:44:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-22 15:44:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-22 15:44:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-22 15:44:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-10-22 15:44:44,460 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 19 [2018-10-22 15:44:44,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:44:44,461 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-10-22 15:44:44,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:44:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2018-10-22 15:44:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 15:44:44,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:44:44,462 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:44:44,462 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:44:44,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:44:44,462 INFO L82 PathProgramCache]: Analyzing trace with hash -847119097, now seen corresponding path program 1 times [2018-10-22 15:44:44,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:44:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:44:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:44:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:44:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:44:44,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:44:44,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:44:44,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:44:44,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:44:44,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:44:44,557 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 3 states. [2018-10-22 15:44:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:44:44,829 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2018-10-22 15:44:44,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:44:44,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-22 15:44:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:44:44,831 INFO L225 Difference]: With dead ends: 60 [2018-10-22 15:44:44,832 INFO L226 Difference]: Without dead ends: 36 [2018-10-22 15:44:44,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:44:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-22 15:44:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-10-22 15:44:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-22 15:44:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-10-22 15:44:44,837 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2018-10-22 15:44:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:44:44,838 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-10-22 15:44:44,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:44:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-10-22 15:44:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 15:44:44,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:44:44,839 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:44:44,839 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:44:44,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:44:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 353686019, now seen corresponding path program 1 times [2018-10-22 15:44:44,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:44:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:44:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:44,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:44:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:44:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:44:44,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:44:44,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 15:44:44,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 15:44:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 15:44:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:44:44,977 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 3 states. [2018-10-22 15:44:45,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:44:45,228 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-10-22 15:44:45,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 15:44:45,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-22 15:44:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:44:45,231 INFO L225 Difference]: With dead ends: 53 [2018-10-22 15:44:45,231 INFO L226 Difference]: Without dead ends: 37 [2018-10-22 15:44:45,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 15:44:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-22 15:44:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-10-22 15:44:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-22 15:44:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-10-22 15:44:45,237 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2018-10-22 15:44:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:44:45,237 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-10-22 15:44:45,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 15:44:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-10-22 15:44:45,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 15:44:45,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:44:45,238 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:44:45,239 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:44:45,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:44:45,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2036060419, now seen corresponding path program 1 times [2018-10-22 15:44:45,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:44:45,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:44:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:45,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:44:45,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:44:45,681 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2018-10-22 15:44:54,005 WARN L179 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 55 DAG size of output: 19 [2018-10-22 15:45:06,142 WARN L179 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 54 DAG size of output: 17 [2018-10-22 15:45:08,169 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse12 c_ULTIMATE.start_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0))) (let ((.cse10 (+ c_ULTIMATE.start_main_~x~0 3)) (.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse12)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_ULTIMATE.start_main_~y~0 .cse11) 4294967296)) (.cse5 (or .cse6 .cse7))) (and (let ((.cse2 (* 4294967296 .cse9)) (.cse4 (* 4294967296 .cse8))) (or (and .cse0 .cse1 (<= (+ .cse2 .cse3 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse3 .cse4 1) c_ULTIMATE.start_main_~y~0) .cse5) (and (or .cse6 (< (+ .cse2 .cse3 2) c_ULTIMATE.start_main_~y~0) .cse7) (or (and .cse0 .cse1) (< (+ .cse3 .cse4) c_ULTIMATE.start_main_~y~0))))) (<= 0 .cse10) (<= .cse10 0) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 3)) .cse0 .cse1) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 1)) .cse5)) (or (and .cse0 .cse1 (<= 0 .cse9)) (and (<= 0 .cse8) .cse5))))))) is different from false [2018-10-22 15:45:22,379 WARN L179 SmtUtils]: Spent 10.11 s on a formula simplification. DAG size of input: 54 DAG size of output: 17 [2018-10-22 15:45:34,502 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 19 [2018-10-22 15:45:36,529 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse4 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse7 (<= .cse12 c_ULTIMATE.start_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse8 (= .cse4 c_ULTIMATE.start_main_~y~0))) (let ((.cse0 (+ c_ULTIMATE.start_main_~x~0 5)) (.cse1 (not .cse8)) (.cse2 (< c_ULTIMATE.start_main_~y~0 .cse12)) (.cse10 (div (+ c_ULTIMATE.start_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse11) 4294967296)) (.cse6 (or .cse7 .cse8))) (and (<= 0 .cse0) (<= .cse0 0) (let ((.cse3 (* 4294967296 .cse10)) (.cse5 (* 4294967296 .cse9))) (or (and .cse1 .cse2 (<= (+ .cse3 .cse4 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse4 .cse5 1) c_ULTIMATE.start_main_~y~0) .cse6) (and (or .cse7 (< (+ .cse3 .cse4 2) c_ULTIMATE.start_main_~y~0) .cse8) (or (and .cse1 .cse2) (< (+ .cse4 .cse5) c_ULTIMATE.start_main_~y~0))))) (< (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296)) (+ c_ULTIMATE.start_main_~x~0 1)) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse4 3)) .cse1 .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse4 1)) .cse6)) (or (and .cse1 .cse2 (<= 0 .cse10)) (and (<= 0 .cse9) .cse6))))))) is different from false [2018-10-22 15:45:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:36,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:45:36,547 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:45:36,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:45:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:45:36,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:45:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:37,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:45:37,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 13 [2018-10-22 15:45:37,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 15:45:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 15:45:37,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=81, Unknown=12, NotChecked=38, Total=156 [2018-10-22 15:45:37,243 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 13 states. [2018-10-22 15:45:39,373 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_ULTIMATE.start_main_~y~0 .cse12) 4294967296)) (.cse3 (* 2 .cse14)) (.cse13 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse13 c_ULTIMATE.start_main_~y~0)) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0)) (.cse4 (* 4294967296 .cse11))) (let ((.cse8 (< (+ .cse3 .cse4) c_ULTIMATE.start_main_~y~0)) (.cse10 (+ c_ULTIMATE.start_main_~x~0 3)) (.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse13)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse12 (- 2)) 4294967296)) (.cse5 (or .cse6 .cse7))) (and (let ((.cse2 (* 4294967296 .cse9))) (or (and .cse0 .cse1 (<= (+ .cse2 .cse3 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse3 .cse4 1) c_ULTIMATE.start_main_~y~0) .cse5) (and (or .cse6 (< (+ .cse2 .cse3 2) c_ULTIMATE.start_main_~y~0) .cse7) (or (and .cse0 .cse1) .cse8)))) .cse8 (<= 0 .cse10) (<= .cse10 0) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 3)) .cse0 .cse1) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 1)) .cse5)) (or (and .cse0 .cse1 (<= 0 .cse9)) (and (<= 0 .cse11) .cse5)))))))) is different from false [2018-10-22 15:45:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:45:39,574 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-10-22 15:45:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:45:39,575 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-10-22 15:45:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:45:39,576 INFO L225 Difference]: With dead ends: 50 [2018-10-22 15:45:39,576 INFO L226 Difference]: Without dead ends: 21 [2018-10-22 15:45:39,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=31, Invalid=100, Unknown=13, NotChecked=66, Total=210 [2018-10-22 15:45:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-22 15:45:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-10-22 15:45:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-22 15:45:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-22 15:45:39,580 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2018-10-22 15:45:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:45:39,580 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-22 15:45:39,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 15:45:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-22 15:45:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 15:45:39,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:45:39,582 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:45:39,582 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:45:39,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:45:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1650300349, now seen corresponding path program 1 times [2018-10-22 15:45:39,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:45:39,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:45:39,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:39,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:45:39,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:45:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:40,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:45:40,310 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:45:40,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:45:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:45:40,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:45:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:40,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:45:40,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-22 15:45:40,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 15:45:40,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 15:45:40,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-22 15:45:40,392 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2018-10-22 15:45:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:45:40,626 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-22 15:45:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-22 15:45:40,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-10-22 15:45:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:45:40,632 INFO L225 Difference]: With dead ends: 37 [2018-10-22 15:45:40,632 INFO L226 Difference]: Without dead ends: 33 [2018-10-22 15:45:40,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-22 15:45:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-22 15:45:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-10-22 15:45:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-22 15:45:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-22 15:45:40,640 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 19 [2018-10-22 15:45:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:45:40,640 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-22 15:45:40,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 15:45:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-22 15:45:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-22 15:45:40,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:45:40,642 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-22 15:45:40,642 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:45:40,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:45:40,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2000470913, now seen corresponding path program 2 times [2018-10-22 15:45:40,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:45:40,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:45:40,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:40,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:45:40,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:45:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:41,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:45:41,188 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:45:41,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:45:41,255 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:45:41,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:45:41,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:45:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:41,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:45:41,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-22 15:45:41,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-22 15:45:41,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-22 15:45:41,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-22 15:45:41,373 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 23 states. [2018-10-22 15:45:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:45:41,947 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-22 15:45:41,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-22 15:45:41,953 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-10-22 15:45:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:45:41,954 INFO L225 Difference]: With dead ends: 49 [2018-10-22 15:45:41,954 INFO L226 Difference]: Without dead ends: 45 [2018-10-22 15:45:41,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-22 15:45:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-22 15:45:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-22 15:45:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-22 15:45:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-22 15:45:41,965 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 31 [2018-10-22 15:45:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:45:41,965 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-22 15:45:41,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-22 15:45:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-22 15:45:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-22 15:45:41,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:45:41,969 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-22 15:45:41,969 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:45:41,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:45:41,969 INFO L82 PathProgramCache]: Analyzing trace with hash 636392635, now seen corresponding path program 3 times [2018-10-22 15:45:41,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:45:41,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:45:41,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:41,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:45:41,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:45:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:43,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:45:43,575 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:45:43,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:45:43,646 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-22 15:45:43,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:45:43,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:45:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:43,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:45:43,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-22 15:45:43,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-22 15:45:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-22 15:45:43,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 15:45:43,768 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 33 states. [2018-10-22 15:45:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:45:45,240 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-22 15:45:45,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-22 15:45:45,245 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2018-10-22 15:45:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:45:45,246 INFO L225 Difference]: With dead ends: 61 [2018-10-22 15:45:45,246 INFO L226 Difference]: Without dead ends: 57 [2018-10-22 15:45:45,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 15:45:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-22 15:45:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-22 15:45:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-22 15:45:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-22 15:45:45,252 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 43 [2018-10-22 15:45:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:45:45,253 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-22 15:45:45,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-22 15:45:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-22 15:45:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-22 15:45:45,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:45:45,255 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-10-22 15:45:45,255 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:45:45,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:45:45,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1267430135, now seen corresponding path program 4 times [2018-10-22 15:45:45,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:45:45,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:45:45,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:45,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:45:45,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:45:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:46,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:45:46,461 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:45:46,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:45:46,506 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:45:46,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:45:46,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:45:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:45:46,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:45:46,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-22 15:45:46,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-22 15:45:46,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-22 15:45:46,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-22 15:45:46,571 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 43 states. [2018-10-22 15:45:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:45:48,528 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-22 15:45:48,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-22 15:45:48,529 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2018-10-22 15:45:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:45:48,530 INFO L225 Difference]: With dead ends: 73 [2018-10-22 15:45:48,531 INFO L226 Difference]: Without dead ends: 69 [2018-10-22 15:45:48,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-22 15:45:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-22 15:45:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-10-22 15:45:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-22 15:45:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-22 15:45:48,538 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 55 [2018-10-22 15:45:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:45:48,539 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-22 15:45:48,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-22 15:45:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-22 15:45:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-22 15:45:48,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:45:48,540 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-10-22 15:45:48,541 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:45:48,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:45:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1837160243, now seen corresponding path program 5 times [2018-10-22 15:45:48,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:45:48,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:45:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:48,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:45:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:45:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:45:49,107 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-10-22 15:45:51,182 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-10-22 15:45:53,273 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:45:55,520 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:45:57,596 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:45:59,608 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse9))) (let ((.cse8 (* (- 2) .cse9)) (.cse6 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0))) (let ((.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse6)) (.cse2 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8 (- 2)) 4294967296))) (.cse4 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8) 4294967296))) (.cse5 (or (<= .cse6 c_ULTIMATE.start_main_~y~0) .cse7))) (and (or (and .cse0 .cse1 (<= (+ .cse2 .cse3 c_ULTIMATE.start_main_~x~0) (+ c_ULTIMATE.start_main_~y~0 12))) (and (<= (+ .cse3 c_ULTIMATE.start_main_~x~0 .cse4) (+ c_ULTIMATE.start_main_~y~0 14)) .cse5)) (<= 14 c_ULTIMATE.start_main_~x~0) (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 (+ .cse2 .cse3 2))) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse4)) .cse5))))))) is different from true [2018-10-22 15:46:01,745 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:05,826 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:07,937 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:10,025 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse8 (* (- 2) .cse9)) (.cse6 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse7 (= .cse1 c_ULTIMATE.start_main_~y~0))) (let ((.cse2 (not .cse7)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse6)) (.cse0 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8 (- 2)) 4294967296))) (.cse4 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8) 4294967296))) (.cse5 (or (<= .cse6 c_ULTIMATE.start_main_~y~0) .cse7))) (and (or (and (<= (+ .cse0 .cse1 c_ULTIMATE.start_main_~x~0) (+ c_ULTIMATE.start_main_~y~0 24)) .cse2 .cse3) (and (<= (+ .cse1 c_ULTIMATE.start_main_~x~0 .cse4) (+ c_ULTIMATE.start_main_~y~0 26)) .cse5)) (<= 26 c_ULTIMATE.start_main_~x~0) (or (and .cse2 .cse3 (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 2))) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse1 .cse4)) .cse5))))))) is different from true [2018-10-22 15:46:12,223 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:14,402 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:18,524 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:20,736 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:22,835 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:25,088 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:29,206 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:33,323 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:35,452 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:37,733 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:40,003 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:42,137 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:44,325 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:46,470 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:48,915 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:51,089 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:53,368 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:56,224 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:46:58,386 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:47:00,706 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:47:03,299 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:47:05,511 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:47:07,693 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 15:47:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-10-22 15:47:08,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:47:08,114 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:47:08,124 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:47:08,437 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-22 15:47:08,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:47:08,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:47:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:47:09,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:47:09,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 65 [2018-10-22 15:47:09,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-22 15:47:09,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-22 15:47:09,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=3776, Unknown=2, NotChecked=246, Total=4160 [2018-10-22 15:47:09,782 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 65 states. [2018-10-22 15:47:16,532 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-10-22 15:47:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:47:18,974 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-10-22 15:47:18,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-22 15:47:18,975 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 67 [2018-10-22 15:47:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:47:18,976 INFO L225 Difference]: With dead ends: 82 [2018-10-22 15:47:18,976 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 15:47:18,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 86.6s TimeCoverageRelationStatistics Valid=143, Invalid=4022, Unknown=3, NotChecked=254, Total=4422 [2018-10-22 15:47:18,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 15:47:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 15:47:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 15:47:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 15:47:18,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-10-22 15:47:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:47:18,980 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 15:47:18,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-22 15:47:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 15:47:18,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 15:47:18,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 15:47:19,206 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-10-22 15:47:19,210 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse6 (div ULTIMATE.start_main_~y~0 2))) (let ((.cse4 (* 2 .cse6)) (.cse5 (* 4294967296 (div (+ ULTIMATE.start_main_~y~0 (* (- 2) .cse6)) 4294967296)))) (let ((.cse3 (+ .cse4 .cse5))) (let ((.cse0 (+ .cse4 ULTIMATE.start_main_~x~0 .cse5)) (.cse1 (= .cse3 ULTIMATE.start_main_~y~0))) (or (and (<= .cse0 (+ ULTIMATE.start_main_~y~0 80)) (<= 80 ULTIMATE.start_main_~x~0) .cse1) (and (<= .cse0 (+ ULTIMATE.start_main_~y~0 100)) (<= 100 ULTIMATE.start_main_~x~0) .cse1) (and (<= ULTIMATE.start_main_~x~0 0) (<= 0 ULTIMATE.start_main_~x~0)) (and (<= .cse0 (+ ULTIMATE.start_main_~y~0 20)) (<= 20 ULTIMATE.start_main_~x~0) .cse1) (and (<= 60 ULTIMATE.start_main_~x~0) (<= .cse0 (+ ULTIMATE.start_main_~y~0 60)) .cse1) (let ((.cse2 (+ ULTIMATE.start_main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (< .cse3 ULTIMATE.start_main_~y~0))) (and (<= 40 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 40) .cse1)))))) [2018-10-22 15:47:19,210 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,210 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,211 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,211 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,211 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-22 15:47:19,211 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-22 15:47:19,211 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 15:47:19,211 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,211 INFO L425 ceAbstractionStarter]: For program point L12-3(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,211 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-22 15:47:19,212 INFO L428 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2018-10-22 15:47:19,212 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 15:47:19,212 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,212 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,212 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,212 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,212 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-10-22 15:47:19,212 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-10-22 15:47:19,212 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 35) no Hoare annotation was computed. [2018-10-22 15:47:19,212 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-22 15:47:19,213 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-22 15:47:19,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 03:47:19 BoogieIcfgContainer [2018-10-22 15:47:19,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 15:47:19,231 INFO L168 Benchmark]: Toolchain (without parser) took 160779.95 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -176.6 MB). Peak memory consumption was 837.9 MB. Max. memory is 7.1 GB. [2018-10-22 15:47:19,232 INFO L168 Benchmark]: CDTParser took 0.23 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-10-22 15:47:19,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.66 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-10-22 15:47:19,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.03 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-10-22 15:47:19,234 INFO L168 Benchmark]: Boogie Preprocessor took 26.05 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-10-22 15:47:19,235 INFO L168 Benchmark]: RCFGBuilder took 555.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-10-22 15:47:19,236 INFO L168 Benchmark]: TraceAbstraction took 159901.48 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 283.1 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 593.2 MB). Peak memory consumption was 876.3 MB. Max. memory is 7.1 GB. [2018-10-22 15:47:19,241 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.23 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 250.66 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 Procedure Inliner took 41.03 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. * Boogie Preprocessor took 26.05 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 555.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159901.48 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 283.1 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 593.2 MB). Peak memory consumption was 876.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 80 && 80 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 100 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || (x <= 0 && 0 <= x)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 20 && 20 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((60 <= x && 2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 60) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) < y)) || ((40 <= x && x <= 40) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 159.8s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 16.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 215 SDtfs, 33 SDslu, 1146 SDs, 0 SdLazy, 7182 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 233 SyntacticMatches, 18 SemanticMatches, 187 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 148.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, 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, 12 MinimizatonAttempts, 14 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 245 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 146 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 141.4s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 450499 SizeOfPredicates, 12 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 8/552 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...