java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/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-df4b876 [2018-11-06 22:44:20,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:44:20,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:44:20,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:44:20,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:44:20,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:44:20,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:44:20,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:44:20,915 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:44:20,916 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:44:20,917 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:44:20,917 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:44:20,918 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:44:20,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:44:20,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:44:20,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:44:20,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:44:20,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:44:20,927 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:44:20,928 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:44:20,929 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:44:20,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:44:20,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:44:20,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:44:20,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:44:20,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:44:20,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:44:20,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:44:20,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:44:20,945 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:44:20,945 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:44:20,946 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:44:20,946 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:44:20,946 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:44:20,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:44:20,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:44:20,951 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:44:20,980 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:44:20,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:44:20,981 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:44:20,981 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:44:20,986 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:44:20,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:44:20,986 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:44:20,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:44:20,987 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:44:20,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:44:20,987 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:44:20,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:44:20,988 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:44:20,988 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:44:20,989 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:44:20,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:44:20,989 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:44:20,989 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:44:20,989 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:44:20,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:44:20,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:44:20,990 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:44:20,990 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:44:20,990 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:44:20,992 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:44:20,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:44:20,992 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:44:20,992 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:44:21,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:44:21,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:44:21,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:44:21,050 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:44:21,051 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:44:21,051 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-06 22:44:21,107 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9ec5e8d/b039120a372e4029b58192b9eef0fc27/FLAGb7d200a20 [2018-11-06 22:44:21,545 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:44:21,546 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-06 22:44:21,555 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9ec5e8d/b039120a372e4029b58192b9eef0fc27/FLAGb7d200a20 [2018-11-06 22:44:21,569 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9ec5e8d/b039120a372e4029b58192b9eef0fc27 [2018-11-06 22:44:21,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:44:21,579 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:44:21,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:44:21,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:44:21,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:44:21,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f02a909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21, skipping insertion in model container [2018-11-06 22:44:21,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:44:21,620 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:44:21,828 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:44:21,832 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:44:21,854 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:44:21,868 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:44:21,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21 WrapperNode [2018-11-06 22:44:21,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:44:21,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:44:21,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:44:21,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:44:21,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:44:21,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:44:21,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:44:21,907 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:44:21,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... [2018-11-06 22:44:21,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:44:21,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:44:21,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:44:21,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:44:21,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:44:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:44:22,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:44:22,527 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:44:22,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:22 BoogieIcfgContainer [2018-11-06 22:44:22,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:44:22,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:44:22,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:44:22,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:44:22,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:44:21" (1/3) ... [2018-11-06 22:44:22,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133b0f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:22, skipping insertion in model container [2018-11-06 22:44:22,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:21" (2/3) ... [2018-11-06 22:44:22,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133b0f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:22, skipping insertion in model container [2018-11-06 22:44:22,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:22" (3/3) ... [2018-11-06 22:44:22,539 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-06 22:44:22,549 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:44:22,559 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:44:22,577 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:44:22,610 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:44:22,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:44:22,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:44:22,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:44:22,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:44:22,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:44:22,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:44:22,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:44:22,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:44:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-06 22:44:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-06 22:44:22,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:44:22,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-11-06 22:44:22,634 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:44:22,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:44:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash 891630823, now seen corresponding path program 1 times [2018-11-06 22:44:22,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:44:22,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:44:22,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:22,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:44:22,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:44:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:44:22,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:44:22,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 22:44:22,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-06 22:44:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-06 22:44:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:44:22,758 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-06 22:44:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:44:22,774 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-11-06 22:44:22,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 22:44:22,775 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2018-11-06 22:44:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:44:22,784 INFO L225 Difference]: With dead ends: 30 [2018-11-06 22:44:22,785 INFO L226 Difference]: Without dead ends: 18 [2018-11-06 22:44:22,788 INFO L604 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-11-06 22:44:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-06 22:44:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-06 22:44:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-06 22:44:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-11-06 22:44:22,825 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 6 [2018-11-06 22:44:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:44:22,825 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-06 22:44:22,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-06 22:44:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2018-11-06 22:44:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-06 22:44:22,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:44:22,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:44:22,827 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:44:22,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:44:22,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1805983239, now seen corresponding path program 1 times [2018-11-06 22:44:22,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:44:22,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:44:22,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:22,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:44:22,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:44:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:44:23,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:44:23,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:44:23,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:44:23,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:44:23,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:44:23,028 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 3 states. [2018-11-06 22:44:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:44:23,278 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2018-11-06 22:44:23,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:44:23,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-06 22:44:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:44:23,282 INFO L225 Difference]: With dead ends: 25 [2018-11-06 22:44:23,282 INFO L226 Difference]: Without dead ends: 21 [2018-11-06 22:44:23,283 INFO L604 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-11-06 22:44:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-06 22:44:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-06 22:44:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-06 22:44:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-11-06 22:44:23,292 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 7 [2018-11-06 22:44:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:44:23,294 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-11-06 22:44:23,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:44:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2018-11-06 22:44:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:44:23,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:44:23,296 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:44:23,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:44:23,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:44:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1155156665, now seen corresponding path program 1 times [2018-11-06 22:44:23,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:44:23,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:44:23,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:23,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:44:23,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:44:25,404 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-11-06 22:44:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:44:25,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:44:25,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:44:25,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:44:25,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:44:25,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-06 22:44:25,430 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 3 states. [2018-11-06 22:44:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:44:25,437 INFO L93 Difference]: Finished difference Result 40 states and 64 transitions. [2018-11-06 22:44:25,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:44:25,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-06 22:44:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:44:25,439 INFO L225 Difference]: With dead ends: 40 [2018-11-06 22:44:25,439 INFO L226 Difference]: Without dead ends: 24 [2018-11-06 22:44:25,439 INFO L604 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-11-06 22:44:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-06 22:44:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-06 22:44:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-06 22:44:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-11-06 22:44:25,446 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 19 [2018-11-06 22:44:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:44:25,446 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-11-06 22:44:25,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:44:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-06 22:44:25,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:44:25,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:44:25,449 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:44:25,449 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:44:25,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:44:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash -454092087, now seen corresponding path program 1 times [2018-11-06 22:44:25,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:44:25,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:44:25,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:25,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:44:25,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:44:27,539 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-11-06 22:44:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:44:27,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:44:27,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:44:27,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:44:27,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:44:27,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-06 22:44:27,544 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 3 states. [2018-11-06 22:44:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:44:27,549 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2018-11-06 22:44:27,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:44:27,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-06 22:44:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:44:27,550 INFO L225 Difference]: With dead ends: 45 [2018-11-06 22:44:27,550 INFO L226 Difference]: Without dead ends: 25 [2018-11-06 22:44:27,551 INFO L604 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-11-06 22:44:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-06 22:44:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-06 22:44:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-06 22:44:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-11-06 22:44:27,555 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 19 [2018-11-06 22:44:27,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:44:27,555 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-11-06 22:44:27,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:44:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2018-11-06 22:44:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:44:27,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:44:27,557 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:44:27,557 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:44:27,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:44:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash -847119097, now seen corresponding path program 1 times [2018-11-06 22:44:27,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:44:27,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:44:27,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:27,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:44:27,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:44:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:44:27,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:44:27,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:44:27,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:44:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:44:27,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:44:27,675 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 3 states. [2018-11-06 22:44:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:44:27,961 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2018-11-06 22:44:27,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:44:27,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-06 22:44:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:44:27,964 INFO L225 Difference]: With dead ends: 60 [2018-11-06 22:44:27,964 INFO L226 Difference]: Without dead ends: 36 [2018-11-06 22:44:27,966 INFO L604 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-11-06 22:44:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-06 22:44:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-06 22:44:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-06 22:44:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-11-06 22:44:27,975 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2018-11-06 22:44:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:44:27,975 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-06 22:44:27,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:44:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-11-06 22:44:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:44:27,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:44:27,976 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:44:27,978 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:44:27,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:44:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash 353686019, now seen corresponding path program 1 times [2018-11-06 22:44:27,979 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:44:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:44:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:27,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:44:27,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:44:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:44:28,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:44:28,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:44:28,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:44:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:44:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:44:28,140 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 3 states. [2018-11-06 22:44:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:44:28,418 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-06 22:44:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:44:28,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-06 22:44:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:44:28,421 INFO L225 Difference]: With dead ends: 53 [2018-11-06 22:44:28,422 INFO L226 Difference]: Without dead ends: 37 [2018-11-06 22:44:28,422 INFO L604 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-11-06 22:44:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-06 22:44:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-06 22:44:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-06 22:44:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-06 22:44:28,427 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2018-11-06 22:44:28,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:44:28,427 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-06 22:44:28,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:44:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-06 22:44:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:44:28,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:44:28,429 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:44:28,429 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:44:28,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:44:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2036060419, now seen corresponding path program 1 times [2018-11-06 22:44:28,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:44:28,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:44:28,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:28,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:44:28,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:44:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:44:28,836 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2018-11-06 22:44:30,868 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 1)) (.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) (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))))) (<= .cse0 0) (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-11-06 22:44:32,884 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse11 c_ULTIMATE.start_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0))) (let ((.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse11)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_ULTIMATE.start_main_~y~0 .cse10) 4294967296)) (.cse5 (or .cse6 .cse7))) (and (<= 1 c_ULTIMATE.start_main_~x~0) (<= c_ULTIMATE.start_main_~x~0 1) (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))))) (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-11-06 22:44:34,905 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-11-06 22:44:36,949 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse11 c_ULTIMATE.start_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0))) (let ((.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse11)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_ULTIMATE.start_main_~y~0 .cse10) 4294967296)) (.cse5 (or .cse6 .cse7))) (and (<= c_ULTIMATE.start_main_~x~0 3) (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))))) (<= 3 c_ULTIMATE.start_main_~x~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-11-06 22:44:38,985 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))))) (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-11-06 22:44:49,146 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 60 DAG size of output: 19 [2018-11-06 22:44:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-06 22:44:49,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:44:49,185 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 22:44:49,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:44:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:44:49,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:44:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:44:50,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:44:50,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2018-11-06 22:44:50,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 22:44:50,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 22:44:50,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=92, Unknown=7, NotChecked=110, Total=240 [2018-11-06 22:44:50,126 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 16 states. [2018-11-06 22:44:52,256 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 1)) (.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 (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (<= 0 .cse0) (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))))) (<= .cse0 0) (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-11-06 22:44:54,264 WARN L854 $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 1)) (.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 (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (<= 0 .cse0) (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))))) (<= .cse0 0) (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 true [2018-11-06 22:44:56,285 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse11 c_ULTIMATE.start_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0))) (let ((.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse11)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_ULTIMATE.start_main_~y~0 .cse10) 4294967296)) (.cse5 (or .cse6 .cse7))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (<= 1 c_ULTIMATE.start_main_~x~0) (<= c_ULTIMATE.start_main_~x~0 1) (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))))) (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-11-06 22:44:58,319 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 (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (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-11-06 22:45:00,360 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse11 c_ULTIMATE.start_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse7 (= .cse3 c_ULTIMATE.start_main_~y~0))) (let ((.cse0 (not .cse7)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse11)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_ULTIMATE.start_main_~y~0 .cse10) 4294967296)) (.cse5 (or .cse6 .cse7))) (and (<= c_ULTIMATE.start_main_~x~0 3) (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (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))))) (<= 3 c_ULTIMATE.start_main_~x~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-11-06 22:45:02,540 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)) (.cse4 (* 2 .cse14)) (.cse13 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse7 (<= .cse13 c_ULTIMATE.start_main_~y~0)) (.cse8 (= .cse4 c_ULTIMATE.start_main_~y~0)) (.cse5 (* 4294967296 .cse11))) (let ((.cse0 (+ c_ULTIMATE.start_main_~x~0 5)) (.cse9 (< (+ .cse4 .cse5) c_ULTIMATE.start_main_~y~0)) (.cse1 (not .cse8)) (.cse2 (< c_ULTIMATE.start_main_~y~0 .cse13)) (.cse10 (div (+ c_ULTIMATE.start_main_~y~0 .cse12 (- 2)) 4294967296)) (.cse6 (or .cse7 .cse8))) (and (<= 0 .cse0) (<= .cse0 0) (let ((.cse3 (* 4294967296 .cse10))) (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) .cse9)))) .cse9 (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 .cse11) .cse6)))))))) is different from false [2018-11-06 22:45:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:45:02,642 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-06 22:45:02,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 22:45:02,643 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-06 22:45:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:45:02,644 INFO L225 Difference]: With dead ends: 48 [2018-11-06 22:45:02,644 INFO L226 Difference]: Without dead ends: 44 [2018-11-06 22:45:02,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=45, Invalid=114, Unknown=13, NotChecked=290, Total=462 [2018-11-06 22:45:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-06 22:45:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-06 22:45:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-06 22:45:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-06 22:45:02,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 19 [2018-11-06 22:45:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:45:02,651 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-06 22:45:02,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 22:45:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-06 22:45:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:45:02,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:45:02,652 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:45:02,653 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:45:02,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:45:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1650300349, now seen corresponding path program 1 times [2018-11-06 22:45:02,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:45:02,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:45:02,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:02,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:45:02,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:45:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:02,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:45:02,949 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 22:45:02,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:45:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:45:02,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:45:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:03,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:45:03,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-06 22:45:03,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 22:45:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 22:45:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:45:03,045 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 13 states. [2018-11-06 22:45:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:45:03,642 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-06 22:45:03,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 22:45:03,642 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-06 22:45:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:45:03,644 INFO L225 Difference]: With dead ends: 60 [2018-11-06 22:45:03,644 INFO L226 Difference]: Without dead ends: 56 [2018-11-06 22:45:03,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:45:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-06 22:45:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-06 22:45:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-06 22:45:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-06 22:45:03,653 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 19 [2018-11-06 22:45:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:45:03,654 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-06 22:45:03,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 22:45:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-06 22:45:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-06 22:45:03,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:45:03,655 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-06 22:45:03,656 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:45:03,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:45:03,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1986926081, now seen corresponding path program 2 times [2018-11-06 22:45:03,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:45:03,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:45:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:03,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:45:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:45:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:04,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:45:04,041 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 22:45:04,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:45:04,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:45:04,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:45:04,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:45:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:04,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:45:04,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-06 22:45:04,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 22:45:04,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 22:45:04,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:45:04,153 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 8 states. [2018-11-06 22:45:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:45:04,307 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-06 22:45:04,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:45:04,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-06 22:45:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:45:04,309 INFO L225 Difference]: With dead ends: 59 [2018-11-06 22:45:04,310 INFO L226 Difference]: Without dead ends: 32 [2018-11-06 22:45:04,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:45:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-06 22:45:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-06 22:45:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-06 22:45:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-06 22:45:04,315 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 31 [2018-11-06 22:45:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:45:04,315 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-06 22:45:04,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 22:45:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-06 22:45:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-06 22:45:04,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:45:04,317 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-06 22:45:04,317 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:45:04,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:45:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2000470913, now seen corresponding path program 2 times [2018-11-06 22:45:04,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:45:04,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:45:04,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:04,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:45:04,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:45:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:04,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:45:04,849 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 22:45:04,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:45:04,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:45:04,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:45:04,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:45:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:05,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:45:05,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-06 22:45:05,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-06 22:45:05,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-06 22:45:05,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-11-06 22:45:05,025 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 23 states. [2018-11-06 22:45:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:45:06,051 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-06 22:45:06,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-06 22:45:06,052 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-11-06 22:45:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:45:06,053 INFO L225 Difference]: With dead ends: 49 [2018-11-06 22:45:06,054 INFO L226 Difference]: Without dead ends: 45 [2018-11-06 22:45:06,055 INFO L604 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-11-06 22:45:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-06 22:45:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-06 22:45:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-06 22:45:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-06 22:45:06,060 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 31 [2018-11-06 22:45:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:45:06,060 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-06 22:45:06,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-06 22:45:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-06 22:45:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-06 22:45:06,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:45:06,062 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-06 22:45:06,062 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:45:06,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:45:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash 636392635, now seen corresponding path program 3 times [2018-11-06 22:45:06,063 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:45:06,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:45:06,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:06,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:45:06,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:45:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:06,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:45:06,999 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 22:45:07,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:45:07,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-06 22:45:07,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:45:07,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:45:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:07,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:45:07,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-06 22:45:07,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-06 22:45:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-06 22:45:07,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 22:45:07,124 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 33 states. [2018-11-06 22:45:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:45:08,563 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-06 22:45:08,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-06 22:45:08,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2018-11-06 22:45:08,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:45:08,565 INFO L225 Difference]: With dead ends: 61 [2018-11-06 22:45:08,565 INFO L226 Difference]: Without dead ends: 57 [2018-11-06 22:45:08,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 22:45:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-06 22:45:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-06 22:45:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-06 22:45:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-06 22:45:08,571 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 43 [2018-11-06 22:45:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:45:08,572 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-06 22:45:08,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-06 22:45:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-06 22:45:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-06 22:45:08,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:45:08,573 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-06 22:45:08,573 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:45:08,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:45:08,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1267430135, now seen corresponding path program 4 times [2018-11-06 22:45:08,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:45:08,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:45:08,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:08,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:45:08,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:45:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:09,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:45:09,989 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 22:45:10,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-06 22:45:10,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-06 22:45:10,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:45:10,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:45:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:10,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:45:10,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-11-06 22:45:10,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-06 22:45:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-06 22:45:10,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-11-06 22:45:10,081 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 43 states. [2018-11-06 22:45:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:45:11,977 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-11-06 22:45:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-06 22:45:11,978 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2018-11-06 22:45:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:45:11,979 INFO L225 Difference]: With dead ends: 73 [2018-11-06 22:45:11,979 INFO L226 Difference]: Without dead ends: 69 [2018-11-06 22:45:11,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-11-06 22:45:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-06 22:45:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-06 22:45:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-06 22:45:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-11-06 22:45:11,986 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 55 [2018-11-06 22:45:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:45:11,987 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-11-06 22:45:11,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-06 22:45:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-06 22:45:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-06 22:45:11,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:45:11,988 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-06 22:45:11,988 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:45:11,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:45:11,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1837160243, now seen corresponding path program 5 times [2018-11-06 22:45:11,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:45:11,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:45:11,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:11,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:45:11,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:45:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:45:12,460 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-11-06 22:45:16,519 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-11-06 22:45:20,580 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-06 22:45:22,592 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 6))) (and (<= (+ .cse3 c_ULTIMATE.start_main_~x~0 .cse4) (+ c_ULTIMATE.start_main_~y~0 8)) .cse5)) (<= 8 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-11-06 22:45:25,024 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-06 22:45:26,352 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-06 22:45:28,615 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-06 22:45:32,750 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-06 22:45:34,887 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-06 22:45:37,983 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-06 22:45:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-11-06 22:45:41,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:45:41,496 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:45:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-06 22:45:41,751 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-06 22:45:41,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:45:41,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:45:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:45:42,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:45:42,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 64 [2018-11-06 22:45:43,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-06 22:45:43,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-06 22:45:43,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=3775, Unknown=1, NotChecked=122, Total=4032 [2018-11-06 22:45:43,002 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 64 states. [2018-11-06 22:45:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:45:48,184 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-11-06 22:45:48,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-06 22:45:48,184 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 67 [2018-11-06 22:45:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:45:48,185 INFO L225 Difference]: With dead ends: 82 [2018-11-06 22:45:48,185 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 22:45:48,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=141, Invalid=4021, Unknown=2, NotChecked=126, Total=4290 [2018-11-06 22:45:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 22:45:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 22:45:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 22:45:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 22:45:48,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-11-06 22:45:48,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:45:48,188 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 22:45:48,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-06 22:45:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 22:45:48,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 22:45:48,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 22:45:52,407 WARN L179 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2018-11-06 22:45:52,410 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)) (let ((.cse2 (+ ULTIMATE.start_main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (< .cse3 ULTIMATE.start_main_~y~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) (and (<= 40 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 40) .cse1)))))) [2018-11-06 22:45:52,411 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,411 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,411 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,411 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,411 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 22:45:52,411 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 22:45:52,411 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 22:45:52,411 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point L12-3(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L428 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-06 22:45:52,412 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-06 22:45:52,413 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 35) no Hoare annotation was computed. [2018-11-06 22:45:52,413 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-06 22:45:52,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:45:52 BoogieIcfgContainer [2018-11-06 22:45:52,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:45:52,430 INFO L168 Benchmark]: Toolchain (without parser) took 90851.72 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. [2018-11-06 22:45:52,431 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-11-06 22:45:52,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.84 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-11-06 22:45:52,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:45:52,433 INFO L168 Benchmark]: Boogie Preprocessor took 25.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:45:52,434 INFO L168 Benchmark]: RCFGBuilder took 597.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-11-06 22:45:52,435 INFO L168 Benchmark]: TraceAbstraction took 89897.06 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 312.5 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -238.3 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. [2018-11-06 22:45:52,439 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 288.84 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 37.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 597.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89897.06 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 312.5 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -238.3 MB). Peak memory consumption was 74.2 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)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) < y)) || ((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)) || ((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, 89.8s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 33 SDslu, 1205 SDs, 0 SdLazy, 7552 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 268 SyntacticMatches, 18 SemanticMatches, 199 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 73.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=12, 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, 13 MinimizatonAttempts, 13 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 245 HoareAnnotationTreeSize, 2 FomulaSimplifications, 89 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 310 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 60.5s InterpolantComputationTime, 619 NumberOfCodeBlocks, 619 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 474631 SizeOfPredicates, 13 NumberOfNonLiveVariables, 824 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 36/584 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...